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,657 papers · 148 categories

Trend · papers per month

9.9%19.8%29.6%39.5% · Jun 202019922001200920172026
48 results for performative stability

Develops a minimax optimal estimator for system stability under distribution shift.

problem Ensuring system reliability under changes in the underlying environment.
method Minimax optimal estimation of stability defined in terms of acceptable performance degradation.
result Characterizes the minimax convergence rate and demonstrates practical utility.

Recently, many regularized procedures have been proposed for variable selection in linear regression, but their performance depends on the tuning parameter selection. Here a criterion for the tuning parameter selection is proposed, which combines the strength of both stability selection and cross-validation and therefo…

2013-01-30abs ↗pdf ↗

Pipeline learns topological features for protein stability prediction.

problem Predicting protein stability using topological features.
method Data-driven method to learn topological features, comparing with expert features.
result Topological features achieve 92%-99% of SME-based models' performance.

The paper explores stability and generalization of deep GCNs.

problem Understanding the stability and generalization of deep GCNs from a theoretical perspective.
method Theoretical analysis of stability and generalization properties of deep GCNs.
result The stability and generalization of deep GCNs are influenced by the maximum absolute eigenvalue of the graph filter operators and the depth of the network.

Paper proposes an unsupervised feature selection algorithm with stability guarantees.

problem Feature selection for dimension reduction and interpretability.
method Proposes a novel unsupervised feature selection algorithm with stability guarantees.
result The algorithm has superior generalization performance and stable selected features.

We introduce a notion of algorithmic stability of learning algorithms---that we term \emph{argument stability}---that captures stability of the hypothesis output by the learning algorithm in the normed space of functions from which hypotheses are selected. The main result of the paper bounds the generalization error of…

2017-02-28abs ↗pdf ↗

Survey explores geometric aspects of policy optimization in control systems.

problem Understanding the geometric relationships between control design and optimization.
method Geometric perspective on policy optimization, focusing on parameterization and topology.
result Implications of policy geometry on stability and performance of local search algorithms.

Paper introduces stability in model averaging and proposes a L2-penalty method.

problem Theoretical properties of model averaging from stability perspective.
method Introduces stability, defines asymptotic empirical risk minimizer, and proposes L2-penalty model averaging method.
result Proposed L2-penalty method ensures stability and consistency under reasonable conditions.

To date, the instability of prognostic predictors in a sparse high dimensional model, which hinders their clinical adoption, has received little attention. Stable prediction is often overlooked in favour of performance. Yet, stability prevails as key when adopting models in critical areas as healthcare. Our study propo…

2016-09-28abs ↗pdf ↗

Paper improves zero-shot protein stability prediction by clarifying free-energy foundations.

problem Improving zero-shot protein stability prediction using inverse folding models.
method Clarifying the free-energy foundations of inverse folding models and proposing better estimates of relative stability.
result Significant gains in zero-shot performance can be achieved with simple methods.

WAVE improves stability in reinforcement learning by adaptively weighting critic's loss.

problem Inherent instability in actor-critic reinforcement learning algorithms.
method Wasserstein adaptive value estimation with Sinkhorn approximation.
result Achieves $\mathcal{O}\left(\frac{1}{k} ight)$ convergence rate for critic's mean squared error.

Bayesian algorithm stabilizes unknown continuous-time systems from unstable data.

problem Learning and stabilizing unknown continuous-time systems with uncertain dynamics.
method Bayesian learning algorithm that learns from unstable data to stabilize the system in finite time.
result The algorithm stabilizes unknown continuous-time stochastic linear systems effectively after a short time period.

New algorithm stabilizes RL policy learning through divergence regularization.

problem Stabilize policy learning and improve performance in RL.
method Proximity term constraining discounted state-action visitation distributions to be close to each other.
result Proposed algorithm improves stability and final performance in RL tasks.

Future grid scenario analysis requires a major departure from conventional power system planning, where only a handful of most critical conditions is typically analyzed. To capture the inter-seasonal variations in renewable generation of a future grid scenario necessitates the use of computationally intensive time-seri…

2016-12-14abs ↗pdf ↗

Improves test set performance and reduces out-of-sample disappointment for unstable models.

problem Ensuring strong test set performance via cross-validation for unstable models.
method Nested k-fold cross-validation with hyperparameter selection based on a weighted sum of cross-validation metric and model stability measure.
result Improves out-of-sample MSE for sparse ridge regression and CART by 4% and 2% respectively, compared to k-fold cross-validation.

Paper proposes a new framework to improve stability-based bounds in deep learning.

problem Explaining generalization in overparameterized neural networks.
method Decomposes excess risk dynamics into signal and noise components, applying stability-based bounds only to the noise.
result The decomposition framework improves stability-based bounds and explains generalization in neural networks.

In this paper, we focus on quantifying model stability as a function of random seed by investigating the effects of the induced randomness on model performance and the robustness of the model in general. We specifically perform a controlled study on the effect of random seeds on the behaviour of attention, gradient-bas…

2019-09-23abs ↗pdf ↗

Visually predicting the stability of block towers is a popular task in the domain of intuitive physics. While previous work focusses on prediction accuracy, a one-dimensional performance measure, we provide a broader analysis of the learned physical understanding of the final model and how the learning process can be g…

2018-06-14abs ↗pdf ↗

The paper analyzes stability and generalization of decentralized SGD.

problem Stability and generalization of decentralized stochastic gradient descent.
method Novel formulation of decentralized stochastic gradient descent combined with non/convex optimization theory.
result First stability and generalization guarantees for decentralized stochastic gradient descent.

OMD and DA perform similarly in static settings but OMD is inferior under dynamic learning rates.

problem Proving and understanding the performance difference between OMD and DA under dynamic learning rates.
method Introducing stabilization to OMD and modifying its convergence analysis.
result OMD with stabilization and DA have the same performance guarantees under dynamic learning rates.

AI threatens financial stability through misuse and stealth adoption.

problem Misuse and stealth adoption of AI in financial regulations.
method Analysis of AI's potential risks and criteria for AI suitability.
result AI will likely become widely used by stealth, affecting high-level financial functions.

Noise-robust Koopman operator framework for control with improved stability and performance.

problem Developing a stable and noise-robust Koopman operator for control tasks.
method Proposes a learning framework using Hankel matrix and neural network approximations for system dynamics, ensuring long-term stability and noise robustness.
result Demonstrates improved model performance and noise robustness in control tasks compared to existing methods.

A novel Bayesian computation method using importance weighting improves numerical stability and performance.

problem Bayesian computation stability and performance issues.
method Nonparametric approach via feature means, importance weighting, and kernel Bayes' rule.
result Importance weighted kernel Bayes' rule yields superior numerical stability and performance.

Reinforcement learning is a powerful paradigm for learning optimal policies from experimental data. However, to find optimal policies, most reinforcement learning algorithms explore all possible actions, which may be harmful for real-world systems. As a consequence, learning algorithms are rarely applied on safety-crit…

2017-05-23abs ↗pdf ↗

The paper explores the generalization of quantum neural networks using stability theory.

problem Understanding the generalization properties of quantum neural networks.
method The authors use algorithmic stability to establish generalization bounds for quantum neural networks.
result The paper provides practical insights into the design and training of quantum neural networks.

A new family of penalty functions, adaptive to likelihood, is introduced for model selection in general regression models. It arises naturally through assuming certain types of prior distribution on the regression parameters. To study stability properties of the penalized maximum likelihood estimator, two types of asym…

2013-08-23abs ↗pdf ↗

Proposes a new stability measure for model fitting on similar feature data sets.

problem Model fitting on data sets with similar features is challenging.
method Tuning hyperparameters in a multi-criteria fashion with predictive accuracy and feature selection stability.
result Our approach achieves similar or better predictive performance than single-criteria and stability selection approaches.