New L0 norm added to TDA for market analysis.
problem Improving TDA tools for market prediction.
method Defined and applied L0 norm in TDA for four markets.
result Enhanced TDA tools for market analysis.
On-device research index
arXiv research
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.
169,236 papers · 148 categories
Trend · papers per month
48 results for “L0.5 norm”
Regularization vs. Relaxation: A conic optimization perspective of statistical variable selectioncs.LG
Variable selection is a fundamental task in statistical data analysis. Sparsity-inducing regularization methods are a popular class of methods that simultaneously perform variable selection and model estimation. The central problem is a quadratic optimization problem with an l0-norm penalty. Exactly enforcing the l0-no…
Paper proposes methods to train RBF networks under faults.
problem Training RBF networks with fault tolerance.
method Two novel ADMM-based algorithms using MCP and l0-norm.
result Both methods globally converge to a unique limit point.
Minimal SVM reduces support vectors for better classification.
problem Finding optimal hyperplane for classification with fewer support vectors.
method Proposes a Minimal SVM using L0.5 norm on slack variables.
result Increases classification performance by reducing support vectors.
New algorithm targets nonsmooth constraints for robust data interpolation and denoising.
problem Robust data interpolation and denoising with large outliers and varying amplitudes.
method Flexible algorithmic framework targeting nonsmooth level-set constraints (L1, Linf, L0 norms).
result Improved robustness to large outliers and significant amplitude variations in seismic data.
Improved sample efficiency in learning sparse Ising models.
problem Learning the graph of a sparse Ising model with limited samples.
method Combining L0 and L2 norms to induce sparsity and model non-zero coefficients.
result Improved sample complexity, achieving new state-of-the-art recovery guarantees.
Algorithm for factorizing financial network data into groups.
problem Modeling groups within heterogeneous financial networks.
method Non-negative factorization of an occurrence tensor, l0 norm for sparsity, efficient splitting method.
result Effective factorization of financial documents into embedded groups.
New method improves signal estimation by convexifying -norm constraints.
problem Signal estimation with sparsity and smoothness priors.
method Iterative convex conic quadratic relaxations exploiting -norm and smoothness terms.
result Significantly better estimators than -norm approaches and interpretable parameters.
New group-sparse SVD models improve biclustering of gene expression data.
problem Identifying block patterns with similar expressions in high-dimensional gene expression data.
method Proposed GL1-SVD, GL0-SVD, OGL1-SVD, and OGL0-SVD models with group Lasso and L0-norm penalties, using alternating iterative strategies and ADMM.
result Effective in identifying biologically interpretable gene modules with gene prior group knowledge.
A new Branch-and-Bound solver tackles L0-penalized problems with flexible loss functions.
problem Solving L0-penalized optimization problems with a broader class of loss functions.
method Generic Branch-and-Bound procedure with closed-form expressions for key quantities.
result El0ps solver achieves state-of-the-art performance and extends computational feasibility.
Unified framework for various adversarial attacks on deep networks.
problem Vulnerability of deep neural networks to adversarial attacks.
method ADMM (Alternating Direction Method of Multipliers) for generating adversarial examples.
result ADMM-based attacks achieve highest success rates and minimal distortion.
This paper prunes deep neural networks by grouping channels and using a bounded L1-L0 norm.
problem Improving network efficiency by reducing the number of parameters in deep neural networks.
method Group-wise pruning with a bounded L1-L0 norm regularizer.
result Significant reduction in model size with minimal loss in accuracy.
The paper develops a classification method using penalties on feature selection for high-dimensional data.
problem High-dimensional binary classification with many irrelevant features.
method Empirical risk minimization with l0-penalization for feature selection.
result The method achieves a sparse solution close to true sparsity with high probability and converges to low misclassification risk.
Variable (feature, gene, model, which we use interchangeably) selections for regression with high-dimensional BIGDATA have found many applications in bioinformatics, computational biology, image processing, and engineering. One appealing approach is the L0 regularized regression which penalizes the number of nonzero fe…
Robust Nonparametric Regression via Sparsity Control with Application to Load Curve Data Cleansingstat.ML
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…
Proposes sparse QSVM for better generalization and interpretability.
problem Overfitting and difficulty in interpreting full quadratic classifiers.
method Enforces -norm constraint to promote sparsity and develops a penalty decomposition algorithm.
result The proposed model enhances generalization and produces sparse solutions.
Method introduces topological regularization using information filtering networks.
problem Sparse probabilistic modeling and multicollinear regression.
method Topological regularization via information filtering network.
result Direct application to -norm regularized problems.
Significant attention has been given to minimizing a penalized least squares criterion for estimating sparse solutions to large linear systems of equations. The penalty is responsible for inducing sparsity and the natural choice is the so-called norm. In this paper we develop a Momentumized Iterative Shrinkage Th…
Structured pruning method reduces RNN sizes and speeds up inference.
problem Large RNN models are hard to deploy on edge devices.
method Structured pruning through neuron selection, minimizing L0 norm of weight matrix.
result Nearly 20x speedup achieved without performance loss.
Given a multivariate data set, sparse principal component analysis (SPCA) aims to extract several linear combinations of the variables that together explain the variance in the data as much as possible, while controlling the number of nonzero loadings in these combinations. In this paper we consider 8 different optimiz…
New method speeds up solving L0-regularized least-squares problems.
problem Solving L0-regularized least-squares problems efficiently.
method Safe peeling for Branch-and-Bound algorithm.
result Significant gains in solving time and node exploration.
Learning the "blocking" structure is a central challenge for high dimensional data (e.g., gene expression data). Recently, a sparse singular value decomposition (SVD) has been used as a biclustering tool to achieve this goal. However, this model ignores the structural information between variables (e.g., gene interacti…
DeepHoyer: Learning Sparser Neural Network with Differentiable Scale-Invariant Sparsity Measurescs.LG
DeepHoyer introduces differentiable, scale-invariant sparsity measures for neural networks.
problem Efficiently sparsifying neural networks with scale-invariant sparsity measures.
method Developed DeepHoyer, a set of differentiable, scale-invariant sparsity-inducing regularizers based on the Hoyer measure.
result DeepHoyer produces sparser neural networks than previous methods, maintaining similar accuracy.
Recently, there has been focus on penalized log-likelihood covariance estimation for sparse inverse covariance (precision) matrices. The penalty is responsible for inducing sparsity, and a very common choice is the convex norm. However, the best estimator performance is not always achieved with this penalty. The …
We apply L0 regularization to reduce neural network complexity and interpretability.
problem Over-parameterization in neural networks leads to susceptibility to attacks, loss of interpretability, and increased SWaP-C.
method We use L0 regularization to reduce complexity and evaluate the trade-off between complexity and desired metrics.
result L0 regularization captures saliency in the input space and reduces complexity of neural networks.
Paper proposes SOTL framework for improving transfer learning accuracy and efficiency.
problem Statistical bias and computational efficiency in multi-source domain adaptation.
method Sparse Optimization for Transfer Learning (SOTL) with L0-regularization.
result SOTL significantly improves estimation accuracy and computational speed, especially under adversarial conditions.
Goal: This paper deals with the problems that some EEG signals have no good sparse representation and single channel processing is not computationally efficient in compressed sensing of multi-channel EEG signals. Methods: An optimization model with L0 norm and Schatten-0 norm is proposed to enforce cosparsity and low r…
Federated Learning with L0 constraint improves sparsity and performance.
problem Inherent sparsity in data and models leads to dense models with poor generalizability.
method L0 constraint on model density achieved through probabilistic gates and federated stochastic gradient descent.
result Achieves target sparsity (rho) in FL with minimal loss in statistical performance.
The iterative reweighted Mixed-Norm Estimate for spatio-temporal MEG/EEG source reconstructionstat.AP
Source imaging based on magnetoencephalography (MEG) and electroencephalography (EEG) allows for the non-invasive analysis of brain activity with high temporal and good spatial resolution. As the bioelectromagnetic inverse problem is ill-posed, constraints are required. For the analysis of evoked brain activity, spatia…
Paper proposes a new sparse group k-max regularization for sparsity constraints.
problem Linear inverse problems with sparsity constraints are NP-hard.
method Sparse group k-max regularization, iterative soft thresholding algorithm.
result Approximates l0 norm more closely and enhances group-wise and in-group sparsity.
The purpose of this paper is to present a certain combinatorial method of constructing invariants of isotopy classes of oriented tame links. This arises as a generalization of the known polynomial invariants of Conway and Jones. These invariants have one striking common feature. If L+, L- and L0 are diagrams of oriente…
Signal recovery is one of the key techniques of Compressive sensing (CS). It reconstructs the original signal from the linear sub-Nyquist measurements. Classical methods exploit the sparsity in one domain to formulate the L0 norm optimization. Recent investigation shows that some signals are sparse in multiple domains.…
Linear time dynamic programming for the exact path of optimal models selected from a finite setcs.LG
New algorithm speeds up path computation for optimal models.
problem Finding the exact path of optimal models from a finite set.
method Dynamic programming approach for linear time computation.
result Dynamic programming achieves linear time for breakpoints computation.
Scoring systems are classification models that only require users to add, subtract and multiply a few meaningful numbers to make a prediction. These models are often used because they are practical and interpretable. In this paper, we introduce an off-the-shelf tool to create scoring systems that both accurate and inte…
This study evaluates Lx-norm penalties for resolving complex LC-MS data.
problem Resolving complex LC-MS data with rotational ambiguity.
method Simulated LC-MS data and grid search strategy to compare L0-, L1-, and L2-norm penalties.
result L1-norm penalty (Lasso) provides more sparse solutions and reduces rotational ambiguity.
We compute approximate solutions to L0 regularized linear regression using L1 regularization, also known as the Lasso, as an initialization step. Our algorithm, the Lass-0 ("Lass-zero"), uses a computationally efficient stepwise search to determine a locally optimal L0 solution given any L1 regularization solution. We …
A stealthy framework injects faults into DNNs to misclassify images without affecting overall accuracy.
problem Vulnerability of deep neural networks to misclassification attacks.
method Fault sneaking attack using ADMM optimization with constraints on maintaining model accuracy and minimizing parameter modifications.
result The framework can inject multiple sneaking faults into DNNs without reducing overall accuracy.
Reweighted l1-algorithms have attracted a lot of attention in the field of applied mathematics. A unified framework of such algorithms has been recently proposed by Zhao and Li. In this paper we construct a few new examples of reweighted l1-methods. These functions are certain concave approximations of the l0-norm func…
L0Learn solves sparse learning problems with millions of features.
problem Sparse learning problems with millions of features.
method Approximate algorithms based on coordinate descent and local combinatorial optimization.
result Achieves competitive run times and statistical performance.
Many applications in data analysis rely on the decomposition of a data matrix into a low-rank and a sparse component. Existing methods that tackle this task use the nuclear norm and L1-cost functions as convex relaxations of the rank constraint and the sparsity measure, respectively, or employ thresholding techniques. …
New method quantifies market shocks and their effects.
problem Quantifying the impact and response to market shocks.
method Sparse probabilistic elliptical model with -norm regularization.
result Shock patterns are related to network structure and sector diversification.
We assume data independently sampled from a mixture distribution on the unit ball of the D-dimensional Euclidean space with K+1 components: the first component is a uniform distribution on that ball representing outliers and the other K components are uniform distributions along K d-dimensional linear subspaces restric…
A graph neural network detects beneficial feature interactions for recommender systems.
problem Feature interactions are crucial but not all are beneficial for recommendation accuracy.
method Graph neural network with L0 activation regularization for edge prediction.
result The model outperforms baselines and automatically identifies beneficial feature interactions.
The paper develops a method to dynamically adjust VAE latent space dimensions during training.
problem Under- or overprovisioning of latent space dimensions in VAEs.
method GECO optimizer with -ARM gradient estimator to dynamically adjust latent space dimensions.
result The latent space can be pruned effectively without violating reconstruction error constraints.
A new framework detects changepoints in complex data.
problem Detecting structural changes in data with various patterns and trends.
method Iteratively Reweighted Fused Lasso (IRFL) for L0 model selection.
result IRFL achieves accurate changepoint detection across various challenging scenarios.
Model infers latent variables in sparse coding models using Langevin dynamics.
problem Sampling posterior distribution in sparse coding models.
method Langevin dynamics for inference and simultaneous learning of parameters.
result Langevin dynamics efficiently sample from 'L0 sparse' posterior distribution.
Introduces HTV to measure function complexity in learning schemes.
problem Assessing the complexity of supervised-learning schemes.
method Defines Hessian-Schatten total variation (HTV) as a seminorm to quantify function complexity.
result HTV is invariant to rotations, scalings, and translations, and its minimum value is achieved for linear mappings.
Study compares L1 and VG sparsity priors in inverse problems.
problem Sparse regularization in inverse problems with incomplete or corrupted measurements.
method Compared L1 regularization with Variational Garrote (VG), a probabilistic method approximating L0 sparsity.
result VG often achieves lower minimum generalization error and improved stability in strongly underdetermined regimes.