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.
Sparse reconstruction approaches using the re-weighted l1-penalty have been shown, both empirically and theoretically, to provide a significant improvement in recovering sparse signals in comparison to the l1-relaxation. However, numerical optimization of such penalties involves solving problems with l1-norms in the ob…
Adaptive l1-regularization controls short-selling in portfolio selection.
The use of machine-learning in neuroimaging offers new perspectives in early diagnosis and prognosis of brain diseases. Although such multivariate methods can capture complex relationships in the data, traditional approaches provide irregular (l2 penalty) or scattered (l1 penalty) predictive pattern with a very limited…
Proposes a new method for hyperspectral image dimensionality reduction.
Two sparsity-aware NSAF algorithms improve sparse system identification with lower complexity.
This study evaluates Lx-norm penalties for resolving complex LC-MS data.
New method improves signal reconstruction with nonconvex penalties and parameter control.
Two new methods improve block-sparse signal recovery from noisy data.
In this article, we discuss various implementation of L1 filtering in order to detect some properties of noisy signals. This filter consists of using a L1 penalty condition in order to obtain the filtered signal composed by a set of straight trends or steps. This penalty condition, which determines the number of breaks…
This paper addresses the problem of sparsity penalized least squares for applications in sparse signal processing, e.g. sparse deconvolution. This paper aims to induce sparsity more strongly than L1 norm regularization, while avoiding non-convex optimization. For this purpose, this paper describes the design and use of…
We consider the problem of learning a high-dimensional graphical model in which certain hub nodes are highly-connected to many other nodes. Many authors have studied the use of an l1 penalty in order to learn a sparse graph in high-dimensional setting. However, the l1 penalty implicitly assumes that each edge is equall…
A new method for multivariate regression with clustering.
Faster, better sparse model estimation for large datasets.
Simplifies neural network compression with Gaussian priors and L1 regularization.
Paper analyzes SLOPE via AMP, providing an asymptotically sharp analysis and algorithmic approach.
Proposes an L1-regularized functional SVM for binary classification with functional covariates.
This paper improves adversarial robustness of deep learning models.
We investigate properties of estimators obtained by minimization of U-processes with the Lasso penalty in high-dimensional settings. Our attention is focused on the ranking problem that is popular in machine learning. It is related to guessing the ordering between objects on the basis of their observed predictors. We p…
Recently it has become popular to learn sparse Gaussian graphical models (GGMs) by imposing l1 or group l1,2 penalties on the elements of the precision matrix. Thispenalized likelihood approach results in a tractable convex optimization problem. In this paper, we reinterpret these results as performing MAP estimation u…
We study the problem of learning high dimensional regression models regularized by a structured-sparsity-inducing penalty that encodes prior structural information on either input or output sides. We consider two widely adopted types of such penalties as our motivating examples: 1) overlapping group lasso penalty, base…
Study evaluates various regularization methods for electricity price forecasting.
Paper proposes efficient algorithms for designing SLOPE penalty sequences.
Proposes spred for solving penalty with SGD.
A new method for sparse regression models using graph structure.
Proposes a new SVM model for binary classification with theoretical and practical advantages.
Study ablated data augmentation techniques and their mathematical equivalence to penalties.
In many human brain network studies, we do not have sufficient number (n) of images relative to the number (p) of voxels due to the prohibitively expensive cost of scanning enough subjects. Thus, brain network models usually suffer the small-n large-p problem. Such a problem is often remedied by sparse network models, …
Proposes an optimization framework for sparse robust subspace estimation.
New hybrid model predicts carbon prices using blockchain data.
Improved sample efficiency in learning sparse Ising models.
New algorithms solve L1-regularized SVMs and related LPs, outperforming existing methods.
This work improves model estimation efficiency and subgroup identification in networked systems.
PRESTO improves rare event prediction by shrinking towards proportional odds model.
This paper explores neural networks for colorizing grayscale images.
A new algorithm estimates NARMAX models with L1 regularization using coordinate descent.
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…
Proposes HGP to improve survival analysis models.
Monitoring means to observe a system for any changes which may occur over time, using a monitor or measuring device of some sort. In this paper we formulate a problem of monitoring dates of maximal risk of a financial position. Thus, the systems we are going to observe arise from situations in finance. The measuring de…
It is well known that quantile regression model minimizes the portfolio extreme risk, whenever the attention is placed on the estimation of the response variable left quantiles. We show that, by considering the entire conditional distribution of the dependent variable, it is possible to optimize different risk and perf…
We propose a mixed integer programming (MIP) model and iterative algorithms based on topological orders to solve optimization problems with acyclic constraints on a directed graph. The proposed MIP model has a significantly lower number of constraints compared to popular MIP models based on cycle elimination constraint…
We consider high-dimensional distribution estimation through autoregressive networks. By combining the concepts of sparsity, mixtures and parameter sharing we obtain a simple model which is fast to train and which achieves state-of-the-art or better results on several standard benchmark datasets. Specifically, we use a…
SOR framework improves transfer learning efficiency and adaptability.
We consider the problem of learning a structured multi-task regression, where the output consists of multiple responses that are related by a graph and the correlated response variables are dependent on the common inputs in a sparse but synergistic manner. Previous methods such as l1/l2-regularized multi-task regressio…
Variable selection for high-dimensional linear models has received a lot of attention lately, mostly in the context of l1-regularization. Part of the attraction is the variable selection effect: parsimonious models are obtained, which are very suitable for interpretation. In terms of predictive power, however, these re…
Paper proposes sparse classification method for high-dimensional data.
Regularization improves stability and consistency of sparse autoencoders.
We study the problem of Robust Least Squares Regression (RLSR) where several response variables can be adversarially corrupted. More specifically, for a data matrix X \in R^{p x n} and an underlying model w*, the response vector is generated as y = X'w* + b where b \in R^n is the corruption vector supported over at mos…
We consider the task of estimating a Gaussian graphical model in the high-dimensional setting. The graphical lasso, which involves maximizing the Gaussian log likelihood subject to an l1 penalty, is a well-studied approach for this task. We begin by introducing a surprising connection between the graphical lasso and hi…