A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
2L-FUSE enhances feature sparsity through kernel learning.
Spark Transformer achieves high sparsity in FFN and attention without sacrificing model quality.
Enhances KLR for indefinite kernels with -norm regularization.
Novel regularization for Vision Transformers improves model generalization and sparsity.
CoT improves transformer sample efficiency by reducing input token dependencies and attention sparsity.
Independent component analysis (ICA) is a powerful method for blind source separation based on the assumption that sources are statistically independent. Though ICA has proven useful and has been employed in many applications, complete statistical independence can be too restrictive an assumption in practice. Additiona…
The holy grail in deep neural network research is porting the memory- and computation-intensive network models on embedded platforms with a minimal compromise in model accuracy. To this end, we propose a novel approach, termed as Variational Student, where we reap the benefits of compressibility of the knowledge distil…
Paper improves signal proportion estimation by accounting for variable dependence.
This paper investigates the role of sparsity in Reservoir Computing networks.
The paper studies sparsity in EBF with hyperpriors and proposes a PALM algorithm.
Expands sparse disparity cues from LiDAR to improve stereo matching performance.
Compressive sensing (CS) exploits sparsity to recover sparse or compressible signals from dimensionality reducing, non-adaptive sensing mechanisms. Sparsity is also used to enhance interpretability in machine learning and statistics applications: While the ambient dimension is vast in modern data analysis problems, the…
Paper proposes a new sparse group k-max regularization for sparsity constraints.
Cross-domain collaborative filtering (CF) aims to alleviate data sparsity in single-domain CF by leveraging knowledge transferred from related domains. Many traditional methods focus on enriching compared neighborhood relations in CF directly to address the sparsity problem. In this paper, we propose superhighway const…
Improved fMRI analysis models enhance classification performance and select relevant brain regions.
A new method solves l1-regularized optimization problems efficiently and sparsely.
Using a low-dimensional parametrization of signals is a generic and powerful way to enhance performance in signal processing and statistical inference. A very popular and widely explored type of dimensionality reduction is sparsity; another type is generative modelling of signal distributions. Generative models based o…
Convex optimization with sparsity-promoting convex regularization is a standard approach for estimating sparse signals in noise. In order to promote sparsity more strongly than convex regularization, it is also standard practice to employ non-convex optimization. In this paper, we take a third approach. We utilize a no…
Enhances counterfactual explanations with more valid and informative saliency maps.
To improve the execution speed and efficiency of neural networks in embedded systems, it is crucial to decrease the model size and computational complexity. In addition to conventional compression techniques, e.g., weight pruning and quantization, removing unimportant activations can reduce the amount of data communica…
Using low-frequency (UHF to L-band) ultra-wideband (UWB) synthetic aperture radar (SAR) technology for detecting buried and obscured targets, e.g. bomb or mine, has been successfully demonstrated recently. Despite promising recent progress, a significant open challenge is to distinguish obscured targets from other (nat…
Paper introduces a novel matrix-wise sparse MNNLS formulation and algorithm.
Model compression techniques on Deep Neural Network (DNN) have been widely acknowledged as an effective way to achieve acceleration on a variety of platforms, and DNN weight pruning is a straightforward and effective method. There are currently two mainstreams of pruning methods representing two extremes of pruning reg…
Nonparametric methods are widely applicable to statistical inference problems, since they rely on a few modeling assumptions. In this context, the fresh look advocated here permeates benefits from variable selection and compressive sampling, to robustify nonparametric regression against outliers - that is, data markedl…
This paper improves GNN efficiency for large-scale graph applications.
New algorithm detects tensor dependence structure alterations efficiently.
Enhances DSN with multi-family wavelet transforms and sparsity.
STanHop predicts multivariate time series with memory-enhanced capabilities.
Point-of-Interest (POI) recommendation is one of the most important location-based services helping people discover interesting venues or services. However, the extreme user-POI matrix sparsity and the varying spatio-temporal context pose challenges for POI systems, which affects the quality of POI recommendations. To …
Rocket algorithm classifies time-series data efficiently using random projections and natural sparsity.
The dearth of prescribing guidelines for physicians is one key driver of the current opioid epidemic in the United States. In this work, we analyze medical and pharmaceutical claims data to draw insights on characteristics of patients who are more prone to adverse outcomes after an initial synthetic opioid prescription…
Quantum algorithms can enhance machine learning in different aspects. Here, we study quantum-enhanced least-square support vector machine (LS-SVM). Firstly, a novel quantum algorithm that uses continuous variable to assist matrix inversion is introduced to simplify the algorithm for quantum LS-SVM, while retaining expo…
Neural networks have been shown to be vulnerable against minor adversarial perturbations of their inputs, especially for high dimensional data under attacks. To combat this problem, techniques like adversarial training have been employed to obtain models which are robust on the training set. However, the …
The paper deals with the problem of finding sparse solutions to systems of polynomial equations possibly perturbed by noise. In particular, we show how these solutions can be recovered from group-sparse solutions of a derived system of linear equations. Then, two approaches are considered to find these group-sparse sol…
Enhanced kernel ridgeless regression improves performance with LAB RBF kernels.
CATS enhances MTSF by generating ATS from OTS to improve forecasting accuracy.
Semi-supervised method enhances recommendation from sparse data.
In this letter, we propose enhanced factored three way restricted Boltzmann machines (EFTW-RBMs) for speech detection. The proposed model incorporates conditional feature learning by multiplying the dynamical state of the third unit, which allows a modulation over the visible-hidden node pairs. Instead of stacking prev…
Characterizes optimal reconstruction error in high-dimensional Gaussian mixtures.
Survey on using knowledge graphs for better recommender systems.
Novel approach reduces DNN redundancy and enhances computational efficiency.
Principal Component Analysis (PCA) has been used to study the pathogenesis of diseases. To enhance the interpretability of classical PCA, various improved PCA methods have been proposed to date. Among these, a typical method is the so-called sparse PCA, which focuses on seeking sparse loadings. However, the performance…
PEARL uses reinforcement learning to improve matrix preconditioners.
New Bayesian method for sparse multidimensional item response theory.
Model improves CVR estimation in recommender systems by mitigating bias and overlooking causal relationships.
Non-negative blind source separation (BSS) has raised interest in various fields of research, as testified by the wide literature on the topic of non-negative matrix factorization (NMF). In this context, it is fundamental that the sources to be estimated present some diversity in order to be efficiently retrieved. Spar…
One of the most challenging problems in kernel online learning is to bound the model size and to promote the model sparsity. Sparse models not only improve computation and memory usage, but also enhance the generalization capacity, a principle that concurs with the law of parsimony. However, inappropriate sparsity mode…
Improved GRU model with multi-head cross-attention enhances stock prediction accuracy.