Research
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.

168,742 papers · 148 categories

Trend · papers per month

3.4%6.8%10.1%13.5% · Mar 202619922001200920172026
48 results for penalized risk

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.

Corrects GCV for inconsistent risk estimation in finite ensembles of penalized estimators.

problem Inconsistent risk estimation of GCV for finite ensembles of penalized estimators.
method Identifies a correction involving an additional scalar correction based on degrees of freedom adjusted training errors from each ensemble component.
result CGCV maintains computational advantages of GCV and is model-free uniformly consistent for ridge regression.

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.

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…

2009-07-21abs ↗pdf ↗

The paper develops robust risk measures for uncertain loss positions.

problem Risk assessment for loss positions with uncertain distributions.
method Robust optimized certainty equivalents and generalized quantiles are proposed and analyzed.
result Robust expectiles with specific penalization functions are coherent risk measures.

PyDTS analyzes survival data with discrete intervals and competing risks.

problem Discrete-time survival analysis with competing risks and optional penalization.
method Regularized estimation methods, model evaluation metrics, variable screening tools, and simulation module.
result Supports research and development in discrete-time survival analysis.

The matrix completion problem consists in reconstructing a matrix from a sample of entries, possibly observed with noise. A popular class of estimator, known as nuclear norm penalized estimators, are based on minimizing the sum of a data fitting term and a nuclear norm penalization. Here, we investigate the case where …

2015-02-24abs ↗pdf ↗

Study optimizes portfolio to minimize relative drawdown duration, penalizing unfavorable performance states.

problem Minimizing relative drawdown duration in portfolio optimization relative to a benchmark.
method Introduces a benchmark-relative drawdown-duration criterion penalizing unfavorable performance states. Uses a one-dimensional Markovian representation and Hamilton-Jacobi-Bellman equation.
result Derives explicit projection-based characterization of the optimal feedback control and identifies geometric settings for unique strong solutions.

The paper develops a deep neural network estimator for weakly dependent processes with various loss functions.

problem Learning weakly dependent processes with a broad class of loss functions.
method Sparse-penalized deep neural networks with ψψ-weak dependence structure and θθ_\infty-coefficients.
result Oracle inequalities for the excess risk of the sparse-penalized deep neural networks estimators.

Proposes a new model to analyze CT scans for lung cancer patients.

problem Analyzing survival risks of lung cancer patients using CT scans.
method Penalized Deep Partially Linear Cox Model (Penalized DPLC) incorporating SCAD penalty and deep neural network.
result The model effectively selects important texture features and estimates nonparametric components.

Paper proposes a new method to optimize deep neural networks with sparse regularization.

problem Difficulty in achieving optimal convergence rates for deep neural networks due to sparsity constraints.
method Introduces a novel penalized estimation method for sparse DNNs, resolving computational and theoretical issues.
result Establishes an oracle inequality for the excess risk of the proposed sparse-penalized DNN estimator and derives convergence rates.

Let $\cF$ be a set of MM classification procedures with values in [1,1][-1,1]. Given a loss function, we want to construct a procedure which mimics at the best possible rate the best procedure in $\cF$. This fastest rate is called optimal rate of aggregation. Considering a continuous scale of loss functions with various …

2007-03-27abs ↗pdf ↗

Study dynamic risk measures with distributional uncertainty using optimal transport.

problem Risk robustification under distributional uncertainty in Markovian models.
method Characterize risk measures via convex monotone semigroups and optimal transport costs.
result Identify generator and correction terms for dynamic risk measures under different scaling regimes.

We consider first order expansions of convex penalized estimators in high-dimensional regression problems with random designs. Our setting includes linear regression and logistic regression as special cases. For a given penalty function hh and the corresponding penalized estimator β^\hatβ, we construct a quantity ηη,…

2019-10-12abs ↗pdf ↗

This paper optimizes portfolio selection by penalizing tracking error, improving Sharpe ratio.

problem Optimizing portfolio allocation with a penalty for deviation from a reference portfolio.
method Formulated as a McKean-Vlasov control problem, provides explicit solutions and asymptotic expansions.
result The penalized portfolio strategy outperforms standard mean-variance and reference portfolios in most cases.

This paper extends the standard chaining technique to prove excess risk upper bounds for empirical risk minimization with random design settings even if the magnitude of the noise and the estimates is unbounded. The bound applies to many loss functions besides the squared loss, and scales only with the sub-Gaussian or …

2016-09-07abs ↗pdf ↗

Sparse multinomial logistic regression for multiclass classification with feature selection.

problem High-dimensional multiclass classification with a focus on sparse models.
method Penalized maximum likelihood with complexity penalty, feature selection using group Lasso and Slope classifiers.
result Achievement of minimax order in both small and large number of classes regimes.

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…

2015-07-01abs ↗pdf ↗

Model predicts road traffic using high-dimensional time-series with L1-penalization.

problem Predicting high-dimensional road traffic data with limited observations.
method Vector autoregressive model with L1-penalization for high-dimensional regression.
result The approach identifies the most important road sections and is competitive in prediction.

Portfolio selection is the central task for assets management, but it turns out to be very challenging. Methods based on pattern matching, particularly the CORN-K algorithm, have achieved promising performance on several stock markets. A key shortage of the existing pattern matching methods, however, is that the risk i…

2018-02-28abs ↗pdf ↗

Develops a deep learning framework for various data types.

problem Handling nonparametric regression and classification across different data types.
method Introduces a general framework with two estimators: NPDNN and SPDNN, based on data satisfying generalized Bernstein-type inequalities.
result Both NPDNN and SPDNN estimators are minimax optimal in many classical settings.

Study investigates asymptotic risk of overparameterized models, including deep neural networks.

problem Understanding the risk of overparameterized models, especially deep neural networks.
method Analyzes the upper bound of an asymptotic risk of an estimator with penalization, combining Fisher information matrix properties and extended Marchenko-Pastur law.
result Generalized results valid for models without linear-in-feature constraints, indicating small asymptotic risk for specific structures like divisibility.

We present the Shortfall Deviation Risk (SDR), a risk measure that represents the expected loss that occurs with certain probability penalized by the dispersion of results that are worse than such an expectation. SDR combines Expected Shortfall (ES) and Shortfall Deviation (SD), which we also introduce, contemplating t…

2015-01-08abs ↗pdf ↗

Develops methods for estimating constrained function-valued parameters in infinite-dimensional models.

problem Estimating function-valued parameters with structural constraints in complex models.
method Characterizes constrained solutions as minimizers of penalized population risk, using a Lagrange-type formulation and path through unconstrained space.
result Proposes estimators that achieve optimal risk and constraint satisfaction, applicable across various statistical learning approaches.

A robust machine learning approach forecasts U.S. Treasury yields, reducing risk for investors.

problem Noisy and uncertain U.S. Treasury yields pose risk to forecast users.
method Formulates yield curve forecasting as a distributionally robust problem, combining factor models and machine learning.
result Robust forecast combinations improve out-of-sample performance across different maturity periods.

Paper robustifies reinforcement learning with risk-averse methods.

problem Making predictions robust to changes in system dynamics or rewards.
method Approximates Robust Reinforcement Learning using ΦΦ-divergence and Risk-Averse formulation.
result Classical Reinforcement Learning can be robustified using standard deviation penalization.

Bayesian method detects change points and clusters in piece-wise constant signals.

problem Detecting change points and clustering in piece-wise constant signals.
method Nonparametric penalized least square model selection on partitions of design points, with an efficient algorithm.
result Oracle inequality and adaptive upper bound on expected square risk of the estimator.

Risk bounds for Classification and Regression Trees (CART, Breiman et. al. 1984) classifiers are obtained under a margin condition in the binary supervised classification framework. These risk bounds are obtained conditionally on the construction of the maximal deep binary tree and permit to prove that the linear penal…

2009-02-18abs ↗pdf ↗

Data-driven optimization improves mean-variance portfolios by penalizing norms.

problem Estimation error in mean-variance optimization.
method Augment MVO with norm penalties, use neural networks for optimization, and compute derivatives implicitly.
result Data-driven optimization reduces portfolio risk compared to standard MVO.

Study accelerates gradient methods in machine learning, revealing risk and stability connections.

problem Understanding the statistical risk of accelerated gradient methods in machine learning.
method Continuous-time analysis of Nesterov's accelerated gradient method and Polyak's heavy ball method for least squares regression.
result Connections between early stopping, stability, and curvature of loss function are revealed.

Paper proposes deep neural networks for nonparametric regression from dependent data.

problem Nonparametric regression from strongly mixing observations.
method Minimum error entropy principle applied to deep neural networks.
result Deep neural networks achieve minimax optimal convergence rates for Gaussian errors.

A new option pricing model handles non-constant risk aversion and transaction costs.

problem Deriving a pricing model for options with varying risk aversion.
method Developed a transformation method to solve the penalized nonlinear PDE and used finite difference discretization.
result Derived bounds on option prices and proposed a numerical scheme.

This paper tackles model selection for MoE models in high-dimensional data.

problem Model selection for Gaussian-gated localized MoE and block-diagonal covariance localized MoE regression models in high-dimensional data.
method Penalized maximum likelihood estimation framework with non-asymptotic risk bounds.
result Established non-asymptotic risk bounds for model selection in MoE models.