Improved Lasso method for high-dimensional regression with noise estimation.
problem Sparse structure in high-dimensional settings with unknown noise level.
method Smoothed Concomitant Lasso, incorporating noise estimation and efficient solver.
result Increased numerical stability and computational efficiency compared to original formulation.
New method optimizes noise estimation alongside regression coefficients for multimodal neuroimaging data.
problem Heteroscedastic regression models with different noise levels across data sources.
method Generalized Concomitant Multi-Task Lasso for jointly estimating regression coefficients and noise covariance.
result Improved prediction and support identification with correct noise covariance estimation.
New method handles correlated and repeated measurements using smoothed multivariate square-root Lasso.
problem Handling correlated and repeated measurements with complex noise structure.
method Proposes a concomitant estimator that uses non-averaged measurements and leverages smoothing theory for optimization.
result Demonstrates practical benefits on various datasets (toy, simulated, real neuroimaging).
Hypercomplex structures on Courant algebroids unify holomorphic symplectic structures and usual hypercomplex structures. In this note, we prove the equivalence of two characterizations of hypercomplex structures on Courant algebroids, one in terms of Nijenhuis concomitants and the other in terms of (almost) torsionfree…
Finite mixtures of regression models offer a flexible framework for investigating heterogeneity in data with functional dependencies. These models can be conveniently used for unsupervised learning on data with clear regression relationships. We extend such models by imposing an eigen-decomposition on the multivariate …
New methods learn DAGs from noisy data, adapting to noise levels.
problem Inferring causal relationships from observational data with noise and confounding.
method Reformulate DAG learning as a continuous optimization problem over adjacency matrices, jointly inferring structure and noise levels.
result Improved robustness to heteroscedasticity and distribution shifts.
New C-connection characterizes 4D spaces conformal to Einstein spaces.
problem Characterizing 4D spaces conformal to Einstein spaces.
method Introducing C-connection, a Weyl connection that preserves conformal invariance. result Characterizes non-degenerate spaces conformal to Einstein spaces.
New bounds for Lasso and Group Lasso in high dimensions derived.
problem Estimation error bounds for Lasso and Group Lasso in high-dimensional settings.
method Recent advances in high-dimensional statistics to derive new L2 estimation upper bounds.
result Bounds match optimal minimax rate for Lasso and improve over existing results for Group Lasso.
Climate volatility reduces economic growth, especially in poorer countries.
problem Impact of climate volatility on economic growth.
method Exploiting data on 133 countries over 59 years, controlling for temperature changes.
result A 1 degree C increase in temperature volatility leads to a 0.3% decline in GDP growth.
PLS-Lasso integrates dimension reduction into regression for financial index tracking.
problem Dimension reduction and regression are traditionally treated separately in multivariate data analysis.
method PLS-Lasso integrates dimension reduction directly into the regression process, presenting two formulations: PLS-Lasso-v1 and PLS-Lasso-v2.
result PLS-Lasso-v1 and PLS-Lasso-v2 outperform Lasso in financial index tracking.
The paper examines Adaptive Lasso and Transfer Lasso, highlighting their differences and proposing a new method.
problem Comparing and contrasting Adaptive Lasso and Transfer Lasso.
method Theoretical analysis of asymptotic properties and introduction of a new method.
result The Transfer Lasso method reduces non-asymptotic estimation errors compared to Adaptive Lasso.
New proof shows weighted fused lasso has O(n^2) segments.
problem Proving the complexity of the weighted fused lasso.
method New proof showing the number of segments is O(n^2).
result The solution path of the weighted fused lasso has O(n^2) segments.
Bayesian Lasso Sparse model provides sparse estimates in linear and nonlinear regression.
problem Sparse learning in regression models.
method Develops a new sparse learning model using type-II maximum likelihood procedure.
result The BLS model provides sparse estimates and is more precise, especially with noisy data.
DFR reduces the computational cost of sparse-group lasso and adaptive sparse-group lasso.
problem Sparse-group lasso's computational expense and need for tuning.
method Dual Feature Reduction (DFR) using strong screening rules and dual norms.
result DFR drastically reduces computational cost without affecting solution optimality.
The paper compares methods for solving constrained lasso problems.
problem Handling linear constraints in lasso regression.
method Quadratic programming, ADMM, and solution path algorithm.
result Efficiency and accuracy recommendations for different data sizes.
Proposes finding missing features in Lasso solutions.
problem Lasso overlooks features not selected in its optimal solution.
method Computes alternate features efficiently without redundant computations.
result Reasonable alternate features found in 20 newsgroup data.
Simplifies risk minimization combining mean and standard deviation.
problem Minimizing mean and standard deviation under heavy-tailed losses.
method Adapting robust mean estimation technique to include standard deviation.
result Simple approach performs as well or better than alternative risk criteria.
A fast method for Lasso and Logistic Lasso problems.
problem Solving Lasso and Logistic Lasso regression problems efficiently.
method Iterative active set approach using solver updates.
result 31.41 times faster on average for compressed sensing.
We introduce an application of the group lasso to design of experiments. Note that we are NOT trying to explain experimental design for the group lasso. Conversely, we explain how we can use the idea of the group lasso in experimental design, showing that the problem of constructing an optimal design matrix can be tran…
New method for tuning Graphical Lasso hyperparameters.
problem Tuning hyperparameters of Graphical Lasso.
method Bilevel optimization with first-order method.
result Derivation of Graphical Lasso Jacobian.
Network Lasso improves graph signal learning from few samples.
problem Ensuring network Lasso accuracy for graph signal learning.
method Compressed sensing concepts applied to network Lasso.
result Precise conditions for network Lasso accuracy quantified.
Network Lasso improves semi-supervised regression on network data.
problem Improving regression accuracy on network data with limited labeled examples.
method Applying network Lasso to semi-supervised regression problems, leveraging message passing over an empirical graph.
result Network Lasso's accuracy is linked to the existence of large network flows over the empirical graph.
LLM-Lasso uses LLMs to improve feature selection in Lasso regression.
problem Improving feature selection in Lasso regression with domain-specific knowledge.
method Combines LLMs with Lasso regularization to generate feature weights.
result Outperforms standard Lasso and feature selection baselines in biomedical studies.
Proposes MM-DUST for efficient generalized lasso solution paths.
problem Efficiently solve generalized lasso problems in large-scale and non-linear models.
method Majorization-minimization dual stagewise algorithm incorporating quadratic majorizers and stagewise learning.
result Established the uniform convergence of approximated solution paths.
Bayesian approach improves network lasso for multi-task learning.
problem Improving the determination of relational coefficients in network lasso.
method Proposes a Bayesian approach to solve multi-task learning problems using network lasso.
result Objective determination of relational coefficients through Bayesian estimation.
This review summarizes five Lasso optimization algorithms.
problem Optimizing the Lasso objective function.
method Five representative algorithms: ISTA, FISTA, CGDA, SLA, PFA.
result Comparison of convergence rates and strengths/weaknesses.
We propose an improved LASSO estimation technique based on Stein-rule. We shrink classical LASSO estimator using preliminary test, shrinkage, and positive-rule shrinkage principle. Simulation results have been carried out for various configurations of correlation coefficients (r), size of the parameter vector (β), …
Exponential Lasso improves Lasso's robustness to outliers and heavy-tailed noise.
problem Lasso's sensitivity to outliers and heavy-tailed noise in high-dimensional statistics.
method Integrates an exponential-type loss function into the Lasso framework.
result Achieves strong statistical convergence rates robust to heavy-tailed contamination.
Develops a diamond price index for online auction platforms.
problem Tracking market trends of wholesale diamond prices.
method Modelling diamond prices to create a hedonic index.
result Provides a basis for constructing derivatives for collectables.
Paper examines LASSO for high-dimensional predictive regression, improving its performance in forecasting unemployment.
problem High-dimensional predictive regression with many predictors and unit roots.
method LASSO with new probabilistic bounds for consistency.
result LASSO maintains its asymptotic guarantee with standardized predictors and improves forecasting of unemployment.
Exclusive Group Lasso improves feature selection in correlated biological data.
problem Correlated features hinder Lasso performance in biological classification problems.
method Proposes and solves the exclusive group Lasso, combining stability selection and random group allocation.
result Exclusive Group Lasso outperforms Lasso in comprehensive selection of informative features.
A new method speeds up overlapping group lasso computations.
problem Time-consuming optimization of overlapping group lasso on large-scale problems.
method Non-overlapping statistical approximation to overlapping group lasso.
result The proposed penalty is statistically equivalent to overlapping group lasso.
The Lasso's complexity is polynomial in problem size with intrinsic noise.
problem Understanding the Lasso's complexity in various settings.
method Smoothed analysis with a tiny amount of intrinsic noise.
result The Lasso's complexity is polynomial in problem size.
New algorithm solves clustered lasso problem efficiently.
problem Learning group structure in regression parameters.
method Inexact semismooth Newton augmented Lagrangian algorithm with efficient Jacobian computation.
result The {\sc Ssnal} algorithm outperforms existing methods.
Paper improves Lasso for S&P500 index tracking with post-selection inference.
problem Index tracking for S&P500 with many applications.
method Used Lasso for dimension reduction and post-selection inference.
result Lasso method for S&P500 index tracking shows high performance.
New hybrid rules improve lasso optimization efficiency.
problem Efficiently solving lasso problems with ultrahigh-dimensional data.
method Hybrid safe-strong rules (HSSR) incorporating safe screening into sequential strong rules.
result HSSR outperforms existing rules in synthetic and real data sets.
The sparse group lasso optimization problem is solved using a coordinate gradient descent algorithm. The algorithm is applicable to a broad class of convex loss functions. Convergence of the algorithm is established, and the algorithm is used to investigate the performance of the multinomial sparse group lasso classifi…
Paper proposes a method to efficiently estimate structural breaks in cointegrating regressions.
problem Estimating structural breaks in cointegrating regressions is challenging due to inconsistency of group lasso.
method Adaptive group lasso procedure using a first step group lasso estimation of diverging breakpoint candidates to produce weights for a second estimation.
result The adaptive group lasso estimator delivers consistent parameter changes and oracle properties.
Improves LASSO by scaling to reduce bias and enhance model selection.
problem LASSO's bias issue affecting sparse model selection.
method Introducing a scaling method to expand LASSO estimator.
result Empirical scaling improves LASSO and enhances model selection.
Proposes a new Lasso method with performance constraints.
problem No control over prediction accuracy for certain individuals.
method Adds quadratic performance constraints to Lasso-based objective functions.
result Defines a constrained sparse regression model through nonlinear optimization.
We study the property of the Fused Lasso Signal Approximator (FLSA) for estimating a blocky signal sequence with additive noise. We transform the FLSA to an ordinary Lasso problem. By studying the property of the design matrix in the transformed Lasso problem, we find that the irrepresentable condition might not hold, …
Improves Lasso's stability in correlated predictor settings.
problem Lasso's selection stability deteriorates with correlated predictors.
method Integrates a weighting scheme into the Lasso penalty function, using a correlation-adjusted ranking.
result Demonstrates improved selection stability on simulated and real-world datasets.
This paper is a survey of dictionary screening for the lasso problem. The lasso problem seeks a sparse linear combination of the columns of a dictionary to best match a given target vector. This sparse representation has proven useful in a variety of subsequent processing and decision tasks. For a given target vector, …
New Lasso algorithm recovers sparse signals on graphs.
problem Signal recovery from graph measurements.
method Combines compressed sensing and graph Fourier analysis.
result Non-convex, non-smooth Lasso outperforms standard Lasso.
Proposes a method to improve Lasso stability via variable decorrelation.
problem Stability of Lasso in high-dimensional settings with correlated variables.
method Variable decorrelation before applying the Lasso.
result Improves stability of variable selection regardless of predictor correlation.
Heavy Lasso improves robustness in high-dimensional linear regression with heavy-tailed errors.
problem Challenges of classical Lasso in handling heavy-tailed noise and outliers.
method Data-augmented soft-thresholding with Student's t-distribution loss.
result Heavy Lasso achieves comparable rates to Huber loss under theoretical bounds.
Paper analyzes adaptive Lasso for high-dimensional diffusion processes, improving support recovery and bias.
problem Support recovery for high-dimensional diffusion processes under sparsity constraints.
method Adaptive Lasso estimator for d-dimensional ergodic diffusion process, focusing on linear models.
result Adaptive Lasso achieves support recovery and asymptotic normality for drift parameter under certain conditions.
A new estimator corrects bias in high-dimensional predictive regressions.
problem Bias in high-dimensional predictive regressions.
method IVX-desparsified LASSO (XDlasso) estimator.
result Corrects both shrinkage and Stambaugh bias.