AgFlow speeds up model selection in penalized PCA.
problem Efficient model selection in penalized PCA for HDLSS settings.
method Implicit regularization effect of gradient flow to reduce computation complexity.
result AgFlow achieves the complete solution path of L2-penalized PCA.
Develops a method to predict stock returns with time-varying risk premia.
problem Predicting stock returns with time-varying risk premia while maintaining no-arbitrage restrictions.
method Penalized two-pass regression with time-varying factor loadings, incorporating penalization in the first pass and grouping in the second pass.
result The proposed method reduces prediction errors compared to other approaches.
Paper develops a new method for optimal stopping in American options.
problem Optimal stopping in American options with singular generators.
method Entropy-regularized penalization scheme for reflected BSDEs with singular generators.
result Limit of the penalization scheme solves a reflected BSDE with a logarithmically singular generator.
New method improves feature selection in tree-based models.
problem Previous feature selection methods in tree-based models lack sufficient regularization and sub-optimal performance.
method Developed a new gain penalization approach for tree-based models that allows for flexible feature-specific importance weights.
result The new method improves out-of-sample performance, especially with correlated features.
New methods correct spectral distortions using known analyte concentrations.
problem Distorted spectral shapes from absorbing and scattering contributions.
method Modified penalized baseline correction methods that incorporate known analyte concentrations.
result Improved prediction performance on near infra-red data sets.
We extend the analysis of investment strategies derived from penalized quantile regression models, introducing alternative approaches to improve state\textendash of\textendash art asset allocation rules. First, we use a post\textendash penalization procedure to deal with overshrinking and concentration issues. Second, …
A new robust regression method handles outliers in high-dimensional data.
problem Outliers in high-dimensional data make conventional regression methods ineffective.
method Robust penalized least squares of depth trimmed residuals regression.
result The new method outperforms existing methods in estimation and prediction accuracy.
We prove that L2-Boosting lacks a theoretical property which is central to the behaviour of l1-penalized methods such as basis pursuit and the Lasso: Whereas l1-penalized methods are guaranteed to recover the sparse parameter vector in a high-dimensional linear model under an appropriate restricted nullspace property, …
Sparse-penalized deep neural networks improve performance in weakly dependent processes.
problem Nonparametric regression and classification under weak dependence.
method Sparse-penalized deep neural networks with oracle inequalities and convergence rates established.
result The proposed estimators outperform non-penalized ones in simulations.
Flexible empirical Bayes for large-scale multiple linear regression.
problem Large-scale multiple linear regression with flexible priors and efficient computation.
method Adaptive shrinkage priors combined with variational approximations for hyperparameter estimation.
result The posterior mean from the empirical Bayes method solves a penalized regression problem.
New insights into balancing reward and fairness in stochastic MAB.
problem Balancing reward and fairness in stochastic multi-armed bandits.
method Formulated a penalization framework and proposed a hard-threshold UCB-like algorithm.
result Asymptotic fairness, nearly optimal regret, better reward-fairness tradeoff.
In high-dimensional data analysis, penalized likelihood estimators are shown to provide superior results in both variable selection and parameter estimation. A new algorithm, APPLE, is proposed for calculating the Approximate Path for Penalized Likelihood Estimators. Both the convex penalty (such as LASSO) and the nonc…
We introduce a new probabilistic method for solving a class of impulse control problems based on their representations as Backward Stochastic Differential Equations (BSDEs for short) with constrained jumps. As an example, our method is used for pricing Swing options. We deal with the jump constraint by a penalization p…
This paper introduces a gradient analysis framework to improve language model performance by rewarding good examples and penalizing bad ones.
problem Improving language model output quality by penalizing bad examples.
method Gradient analysis of loss functions to reward good examples and penalize bad ones.
result ExMATE is superior to MLE and combining DPO with ExMATE enhances performance.
Proposes a new robust expectile regression method for high-dimensional data.
problem Heterogeneity in high-dimensional data with heteroscedastic variance or inhomogeneous covariate effects.
method Iteratively reweighted ℓ1-penalization for robust expectile regression (retire).
result Oracle convergence rate after log(log d) iterations in high-dimensional settings.
Researchers develop a method to learn CTBN structure using penalized maximum likelihood.
problem Learning the structure of continuous-time Bayesian networks (CTBNs) when the dependence structure is unknown.
method Penalized maximum likelihood method.
result The algorithm can accurately identify the network structure with high probability under certain conditions.
Algorithm samples from Wasserstein barycenter of measures.
problem Sampling from Wasserstein barycenter of measures.
method Gradient flow of multimarginal formulation with penalization.
result Algorithm samples close to Wasserstein barycenter.
New fair regression method improves fairness in chronic kidney disease classification.
problem Mitigating societal bias in health care for multiple groups.
method Penalized fair regression framework for multiple groups, with penalties for true positive rate disparity.
result Achieves fairness-accuracy frontier beyond existing methods in simulations and real-world data.
The MM algorithm improves robust penalized estimation for outlier-contaminated data.
problem Outliers in data affect the reliability of penalized estimation.
method Innovative MM algorithm for both convex and nonconvex loss functions.
result Established convergence theory for MM algorithm with various loss functions.
CD converges linearly for MCP/SCAD penalized least squares.
problem Recovering sparse signals from data.
method Coordinate descent for MCP/SCAD penalized least squares.
result CD converges linearly to solutions of MCP/SCAD penalized least squares.
Paper estimates differences in multi-attribute Gaussian graphical models using non-convex penalties.
problem Estimating differences in multi-attribute Gaussian graphical models with similar structure.
method Penalized D-trace loss function with non-convex (log-sum and SCAD) penalties, proximal gradient descent methods.
result Theoretical analysis and numerical examples support consistency in support recovery and estimation.
Paper discusses prediction errors for penalized regressions using GAMP and LOOCV.
problem Prediction accuracy of penalized regression models.
method Derives prediction error estimators using GAMP and LOOCV.
result Information criteria and LOOCV error estimators differ in large parameter regions.
Improved DPO framework penalizes preference uncertainty to avoid overoptimization.
problem Aligning LLMs to human preferences is challenging due to varied, context-dependent, and ambiguous preferences.
method Developed a pessimistic framework for DPO by introducing preference uncertainty penalization schemes.
result Improved overall performance and better completions on high-uncertainty responses compared to vanilla DPO.
Unified framework for pattern recovery in penalized and thresholded estimation.
problem Pattern recovery in penalized and thresholded estimation methods.
method Defining a novel pattern notion based on subdifferentials, introducing accessibility and noiseless recovery conditions.
result Unified and extended conditions for pattern recovery in a broad class of penalized estimators.
We present an approach for penalized tensor decomposition (PTD) that estimates smoothly varying latent factors in multi-way data. This generalizes existing work on sparse tensor decomposition and penalized matrix decompositions, in a manner parallel to the generalized lasso for regression and smoothing problems. Our ap…
Matrix factorization methods are extensively employed to understand complex data. In this paper, we introduce the cross-product penalized component analysis (XCAN), a sparse matrix factorization based on the optimization of a loss function that allows a trade-off between variance maximization and structural preservatio…
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.
The ℓ1-penalized method, or the Lasso, has emerged as an important tool for the analysis of large data sets. Many important results have been obtained for the Lasso in linear regression which have led to a deeper understanding of high-dimensional statistical problems. In this article, we consider a class of weigh…
We theoretically and empirically study portfolio optimization under transaction costs and establish a link between turnover penalization and covariance shrinkage with the penalization governed by transaction costs. We show how the ex ante incorporation of transaction costs shifts optimal portfolios towards regularized …
We give improved constants for data dependent and variance sensitive confidence bounds, called empirical Bernstein bounds, and extend these inequalities to hold uniformly over classes of functionswhose growth function is polynomial in the sample size n. The bounds lead us to consider sample variance penalization, a nov…
The paper develops adaptive deep learning methods for nonlinear time series models.
problem Estimating mean functions of non-stationary and nonlinear time series models.
method Develops non-penalized and sparse-penalized DNN estimators for general non-stationary time series, derives minimax lower bounds, and shows the sparse-penalized DNN estimator is adaptive and optimal.
result Sparse-penalized DNN estimator achieves minimax optimal rates for many nonlinear AR models.
We consider the Willmore functional on graphs, with an additional penalization of the area where the curvature is non-zero. Interpreting the penalization parameter as a Lagrange multiplier, this corresponds to the Willmore functional with a constraint on the area where the graph is flat. Sending the penalization parame…
It has been shown that AIC-type criteria are asymptotically efficient selectors of the tuning parameter in non-concave penalized regression methods under the assumption that the population variance is known or that a consistent estimator is available. We relax this assumption to prove that AIC itself is asymptotically …
A new algorithm speeds up sparse-penalized quantile regression solving non-convex penalties.
problem Sparse-penalized quantile regression with non-convex penalties.
method Single-loop smoothing ADMM (SIAD) algorithm for faster convergence.
result SIAD method outperforms existing approaches in solving sparse-penalized quantile regression.
Existing methods for sparse channel estimation typically provide an estimate computed as the solution maximizing an objective function defined as the sum of the log-likelihood function and a penalization term proportional to the l1-norm of the parameter of interest. However, other penalization terms have proven to have…
G-computation improves clinical trial power with machine learning.
problem Balancing prognostic factors in randomized trials to prevent near-confounders.
method G-computation with penalized models (Lasso, Elasticnet) and algorithm-based methods (neural network, SVM, super learner).
result G-computation with Elasticnet and splines reduces variance and increases power in RCTs.
The paper improves Lasso inference methods for survey data.
problem Improving inference methods for survey data.
method Extends Lasso inferential methods to survey data.
result Establishes asymptotic validity of inference procedures in survey environments.
This paper deals with the problem of large-scale linear supervised learning in settings where a large number of continuous features are available. We propose to combine the well-known trick of one-hot encoding of continuous features with a new penalization called \emph{binarsity}. In each group of binary features comin…
A brain computer interface (BCI) is a system which provides direct communication between the mind of a person and the outside world by using only brain activity (EEG). The event-related potential (ERP)-based BCI problem consists of a binary pattern recognition. Linear discriminant analysis (LDA) is widely used to solve…
The paper proposes a method for predicting equity premium using penalized quantile regression.
problem Heteroscedasticity and heavy-tails in equity premium prediction.
method Penalized quantile regression with consistent variable selection across multiple quantiles.
result The proposed method outperforms benchmark methods and reveals interesting predictor relationships.
Dynamic skewness models improve financial time series analysis.
problem Modeling financial time series with skewness and heavy tails.
method Dynamic skewness stochastic volatility models with penalized priors and HMC estimation.
result Penalized priors outperform classical choices in model performance.
FILTER model uses fusion penalized logistic threshold regression for high-dimensional data with unknown cut points.
problem Modeling high-dimensional data with unknown cut points and binary responses.
method Fusion penalized logistic threshold regression (FILTER) model with fused lasso penalty for variable selection.
result Established non-asymptotic error bounds for coefficient estimation and model selection consistency.
The problem of low-rank matrix estimation recently received a lot of attention due to challenging applications. A lot of work has been done on rank-penalized methods and convex relaxation, both on the theoretical and applied sides. However, only a few papers considered Bayesian estimation. In this paper, we review the …
Paper proposes a sparse synthetic control method to select important predictors.
problem Choosing and weighting predictors affects synthetic control estimator performance.
method Sparse synthetic control procedure that penalizes predictors, derived in a linear factor model.
result Sparse synthetic control achieves lower bias and better post-treatment performance.
SPPCSO addresses multicollinearity in high-dimensional data, improving model stability and predictive accuracy.
problem Multicollinearity in high-dimensional data leads to unstable estimation and reduced predictive accuracy.
method SPPCSO integrates principal component regression and L1 regularization to adaptively adjust shrinkage factors.
result SPPCSO achieves stable and reliable estimation in high-noise settings, distinguishing signal variables from noise.
In this paper, we propose a one-pass algorithm on MapReduce for penalized linear regression \[f_λ(α, β) = \|Y - α\mathbf{1} - Xβ\|_2^2 + p_λ(β)\] where α is the intercept which can be omitted depending on application; β is the coefficients and pλ is the penalized function with penalizing parameter λ. $f_λ(α, β…
Solution to sparse PCA tuning problem using Empirical Bayes.
problem Sparse PCA multiple tuning problem (MTP).
method Empirical Bayes covariance decomposition for penalized PCA.
result Empirical Bayes approach efficiently solves MTP in sparse PCA.
Develops a new method to model overlapping asymmetric datasets effectively.
problem Handling overlapping asymmetric datasets in data science.
method Twice penalized P-Spline approximation method.
result Improves model fit by over 65% in a real-life dataset.