Tootfinder

SPARC: Concept-Aligned Sparse Autoencoders for Cross-Model and Cross-Modal Interpretability
Ali Nasiri-Sarvi, Hassan Rivaz, Mahdi S. Hosseini
https://arxiv.org/abs/2507.06265

SPARC: Concept-Aligned Sparse Autoencoders for Cross-Model and Cross-Modal Interpretability
Understanding how different AI models encode the same high-level concepts, such as objects or attributes, remains challenging because each model typically produces its own isolated representation. Existing interpretability methods like Sparse Autoencoders (SAEs) produce latent concepts individually for each model, resulting in incompatible concept spaces and limiting cross-model interpretability. To address this, we introduce SPARC (Sparse Autoencoders for Aligned Representation of Concepts), a…

STREAMINGGS: Voxel-Based Streaming 3D Gaussian Splatting with Memory Optimization and Architectural Support
Chenqi Zhang, Yu Feng, Jieru Zhao, Guangda Liu, Wenchao Ding, Chentao Wu, Minyi Guo
https://arxiv.org/abs/2506.09070

STREAMINGGS: Voxel-Based Streaming 3D Gaussian Splatting with Memory Optimization and Architectural Support
3D Gaussian Splatting (3DGS) has gained popularity for its efficiency and sparse Gaussian-based representation. However, 3DGS struggles to meet the real-time requirement of 90 frames per second (FPS) on resource-constrained mobile devices, achieving only 2 to 9 FPS.Existing accelerators focus on compute efficiency but overlook memory efficiency, leading to redundant DRAM traffic. We introduce STREAMINGGS, a fully streaming 3DGS algorithm-architecture co-design that achieves fine-grained pipelin…

Sparse Recovery from Group Orbits
Timm Gilles, Hartmut F\"uhr
https://arxiv.org/abs/2507.19274 https://arxiv.org/pdf/2507.19274

Sparse Recovery from Group Orbits
While most existing sparse recovery results allow only minimal structure within the measurement scheme, many practical problems possess significant structure. To address this gap, we present a framework for structured measurements that are generated by random orbits of a group representation associated with a finite group. We differentiate between two scenarios: one in which the sampling set is fixed and another in which the sampling set is randomized. For each case, we derive an estimate for t…

Unrolling Nonconvex Graph Total Variation for Image Denoising
Songlin Wei, Gene Cheung, Fei Chen, Ivan Selesnick
https://arxiv.org/abs/2506.02381 https://

Unrolling Nonconvex Graph Total Variation for Image Denoising
Conventional model-based image denoising optimizations employ convex regularization terms, such as total variation (TV) that convexifies the $\ell_0$-norm to promote sparse signal representation. Instead, we propose a new non-convex total variation term in a graph setting (NC-GTV), such that when combined with an $\ell_2$-norm fidelity term for denoising, leads to a convex objective with no extraneous local minima. We define NC-GTV using a new graph variant of the Huber function, interpretable …

Uni3R: Unified 3D Reconstruction and Semantic Understanding via Generalizable Gaussian Splatting from Unposed Multi-View Images
Xiangyu Sun, Haoyi jiang, Liu Liu, Seungtae Nam, Gyeongjin Kang, Xinjie wang, Wei Sui, Zhizhong Su, Wenyu Liu, Xinggang Wang, Eunbyung Park
https://arxiv.org/abs/2508.03643

Uni3R: Unified 3D Reconstruction and Semantic Understanding via Generalizable Gaussian Splatting from Unposed Multi-View Images
Reconstructing and semantically interpreting 3D scenes from sparse 2D views remains a fundamental challenge in computer vision. Conventional methods often decouple semantic understanding from reconstruction or necessitate costly per-scene optimization, thereby restricting their scalability and generalizability. In this paper, we introduce Uni3R, a novel feed-forward framework that jointly reconstructs a unified 3D scene representation enriched with open-vocabulary semantics, directly from unpos…

Binsparse: A Specification for Cross-Platform Storage of Sparse Matrices and Tensors
Benjamin Brock, Willow Ahrens, Hameer Abbasi, Timothy A. Davis, Juni Kim, James Kitchen, Spencer Patty, Isaac Virshup, Erik Welch
https://arxiv.org/abs/2506.19175

Binsparse: A Specification for Cross-Platform Storage of Sparse Matrices and Tensors
Sparse matrices and tensors are ubiquitous throughout multiple subfields of computing. The widespread usage of sparse data has inspired many in-memory and on-disk storage formats, but the only widely adopted storage specifications are the Matrix Market and FROSTT file formats, which both use ASCII text. Due to the inefficiency of text storage, these files typically have larger file sizes and longer parsing times than binary storage formats, which directly store an in-memory representation to di…

An Enhanced Model-based Approach for Short Text Clustering
Enhao Cheng, Shoujia Zhang, Jianhua Yin, Xuemeng Song, Tian Gan, Liqiang Nie
https://arxiv.org/abs/2507.13793

An Enhanced Model-based Approach for Short Text Clustering
Short text clustering has become increasingly important with the popularity of social media like Twitter, Google+, and Facebook. Existing methods can be broadly categorized into two paradigms: topic model-based approaches and deep representation learning-based approaches. This task is inherently challenging due to the sparse, large-scale, and high-dimensional characteristics of the short text data. Furthermore, the computational intensity required by representation learning significantly increa…

Joint space-time wind field data extrapolation and uncertainty quantification using nonparametric Bayesian dictionary learning
George D. Pasparakis, Ioannis A. Kougioumtzoglou, Michael D. Shields
https://arxiv.org/abs/2507.11385

Joint space-time wind field data extrapolation and uncertainty quantification using nonparametric Bayesian dictionary learning
A methodology is developed, based on nonparametric Bayesian dictionary learning, for joint space-time wind field data extrapolation and estimation of related statistics by relying on limited/incomplete measurements. Specifically, utilizing sparse/incomplete measured data, a time-dependent optimization problem is formulated for determining the expansion coefficients of an associated low-dimensional representation of the stochastic wind field. Compared to an alternative, standard, compressive sam…

Joint Angle and Velocity-Estimation for Target Localization in Bistatic mmWave MIMO Radar in the Presence of Clutter
Priyanka Maity, Suraj Srivastava, Aditya K. Jagannatham, Lajos Hanzo
https://arxiv.org/abs/2506.11497

Joint Angle and Velocity-Estimation for Target Localization in Bistatic mmWave MIMO Radar in the Presence of Clutter
Sparse Bayesian learning (SBL)-aided target localization is conceived for a bistatic mmWave MIMO radar system in the presence of unknown clutter, followed by the development of an angle-Doppler (AD)-domain representation of the target-plus-clutter echo model for accurate target parameter estimation. The proposed algorithm exploits the three-dimensional (3D) sparsity arising in the AD domain of the scattering scene and employs the powerful SBL framework for the estimation of target parameters, s…

EIFNet: Leveraging Event-Image Fusion for Robust Semantic Segmentation
Zhijiang Li, Haoran He
https://arxiv.org/abs/2507.21971 https://arxiv.org/pdf/2507.2…

EIFNet: Leveraging Event-Image Fusion for Robust Semantic Segmentation
Event-based semantic segmentation explores the potential of event cameras, which offer high dynamic range and fine temporal resolution, to achieve robust scene understanding in challenging environments. Despite these advantages, the task remains difficult due to two main challenges: extracting reliable features from sparse and noisy event streams, and effectively fusing them with dense, semantically rich image data that differ in structure and representation. To address these issues, we propose…

ColdPress: Efficient Quantile-Based Compression of Photometric Redshift PDFs
Antonio Hern\'an-Caballero
https://arxiv.org/abs/2507.12481 https://

ColdPress: Efficient Quantile-Based Compression of Photometric Redshift PDFs
ColdPress is a Python module that compresses photometric redshift probability distribution functions (PDFs) by encoding quantiles of their cumulative distribution. For a fixed packet size (the default is 80 bytes per PDF), ColdPress attains a reconstruction accuracy comparable to the sparse-basis representation method implemented in the pdf_storage module of Carrasco-Kind & Brunner (2014), yet reduces the computational cost by a factor of ~7000. I describe the implementation and quantify its co…

NeuVAS: Neural Implicit Surfaces for Variational Shape Modeling
Pengfei Wang, Qiujie Dong, Fangtian Liang, Hao Pan, Lei Yang, Congyi Zhang, Guying Lin, Caiming Zhang, Yuanfeng Zhou, Changhe Tu, Shiqing Xin, Alla Sheffer, Xin Li, Wenping Wang
https://arxiv.org/abs/2506.13050

NeuVAS: Neural Implicit Surfaces for Variational Shape Modeling
Neural implicit shape representation has drawn significant attention in recent years due to its smoothness, differentiability, and topological flexibility. However, directly modeling the shape of a neural implicit surface, especially as the zero-level set of a neural signed distance function (SDF), with sparse geometric control is still a challenging task. Sparse input shape control typically includes 3D curve networks or, more generally, 3D curve sketches, which are unstructured and cannot be …