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

Trend · papers per month

98196294392 · Jun 202019922001200920172026
48 results for robust transitivity

Proves robust transitivity for geodesic flows from metrics with conjugate points.

problem Transitivity of geodesic flows from metrics with conjugate points.
method General criterion for robust transitivity of partially hyperbolic geodesic flows.
result First example of a C2C^2 open set of Riemannian metrics with conjugate points and transitive geodesic flow.

New algorithm reduces performance loss in IRL with mismatched transition dynamics.

problem Performance degradation in inverse reinforcement learning due to mismatched transition dynamics.
method Proposed a robust Maximum Causal Entropy (MCE) IRL algorithm leveraging robust reinforcement learning insights.
result Empirically demonstrated stable performance improvement under transition dynamics mismatches.

The paper tackles robust control for insurance contracts under uncertain transition rates.

problem Maximizing utility in insurance contracts with uncertain transition rates.
method Novel robust utility maximization problem under bounded cumulative transition rate uncertainty, using worst-case scenario analysis.
result Existence and uniqueness of worst-case and best-case reserves for insurance contracts.

A new algorithm for deep Q-learning with robustness to state transition uncertainty.

problem Model uncertainty in state transitions for non-tabular, continuous state spaces.
method Distributionally robust approach using worst-case transition ball and dualized Bellman operator with Sinkhorn distance.
result Optimal policy found through solving non-linear Bellman equation with neural network parameterization.

SCPO learns robust policies without modeling disturbance, improving real-world task performance.

problem Poor performance of reinforcement learning in real-world tasks due to disturbance in transition dynamics.
method State-conservative policy optimization (SCPO) that reduces disturbance to state space and approximates it with a gradient-based regularizer.
result SCPO learns robust policies without prior knowledge of disturbance or simulators, improving performance in robot control tasks.

WRAAC uses Wasserstein distance for robust reinforcement learning.

problem Lack of quantified robustness to system dynamics in existing reinforcement learning algorithms.
method Leverages Wasserstein distance to connect state disturbance to transition kernel disturbance, reducing infinite-dimensional optimization to a finite-dimensional problem.
result Designs a novel algorithm, WRAAC, that achieves robust reinforcement learning.

Model improves robustness of neural network sequences without transition failures.

problem Learning and generating complex sequences of motor primitives without interference.
method Inspired by thalamocortical circuit, uses specific module for motif transitions.
result Improved robustness of sequence generation with no transition failures.

RRPI improves offline RL by optimizing policies against worst-case dynamics.

problem Offline RL's performance degrades under distribution shift and transition uncertainty.
method Formulates offline RL as robust policy optimization, treating transition kernel as decision variable.
result RRPI achieves strong average performance on D4RL benchmarks, outperforming recent baselines.

We define transit clusters to simplify causal diagrams and preserve their essential properties.

problem Clustering variables in causal diagrams can alter essential properties of causal effects.
method We define transit clusters and provide an algorithm to find them, ensuring they preserve causal effect identifiability.
result Transit clusters simplify causal effect identification and maintain their essential properties.

The paper explores robustness in linear regression models under adversarial attacks.

problem The impact of test-time adversarial attacks on linear regression models.
method Quantitative estimates and phase transitions analysis.
result Precise characterization of tradeoffs between adversarial robustness and accuracy.

New algorithms solve robust MDPs efficiently, significantly faster than existing methods.

problem Computing robust MDP solutions with uncertainty in transition probabilities is computationally expensive.
method Partial policy iteration and fast robust Bellman operator computation methods.
result The proposed methods are many orders of magnitude faster than state-of-the-art approaches.

Safe reinforcement learning framework using optimal transport for robustness.

problem Robustness and safety in deep reinforcement learning with limited data assumptions.
method Optimal transport perturbations to construct worst-case virtual state transitions.
result Significantly improved safety at deployment time compared to standard methods.

The paper models market crashes as phase transitions, finding dynamic transitions offer better predictions.

problem Understanding and predicting extreme financial events like market crashes.
method Employing phase transition theory, focusing on endogenous crashes, and comparing DPT, CPT, and SPT.
result Dynamic phase transitions provide more accurate predictions of market crashes compared to critical and stochastic models.

High-dimensional models become unstable when sample size falls below a critical level, leading to a phase transition.

problem Instability in high-dimensional learning models when sample size is insufficient.
method Proved the necessity of a Fisher eigenvalue threshold for stability, introduced Fisher floor for verification.
result A sharp phase transition between reliable concentration and inevitable failure in high-dimensional learning.

Study online RL with mismatched dynamics, achieving sublinear regret.

problem Exploration challenges in online RL with mismatched training and deployment dynamics.
method Introduce supremal visitation ratio, propose efficient algorithm with ff-divergence.
result Achieves sublinear regret in online RMDPs with optimal dependence on supremal visitation ratio and interaction episodes.

DR-RPO optimizes robust policies in RL with limited interaction, achieving sublinear regret.

problem Policy optimization in RL under distribution shift and adversarial dynamics.
method DR-RPO algorithm incorporating reference-policy regularization and upper confidence bonus for exploration.
result DR-RPO achieves sublinear regret and polynomial suboptimality bounds in robust RL.

The interaction between transitivity and sparsity, two common features in empirical networks, implies that there are local regions of large sparse networks that are dense. We call this the blessing of transitivity and it has consequences for both modeling and inference. Extant research suggests that statistical inferen…

2013-07-08abs ↗pdf ↗

We develop efficient and sharp bounds on policy value under perturbations in MDPs.

problem Evaluating policies under best- and worst-case perturbations in MDPs with transition observations.
method Proposed a perturbation model for MDPs, developed semiparametrically efficient estimator with asymptotic normality.
result Semiparametrically efficient and asymptotically normal estimator for policy value bounds.

Novel framework for risk-sensitive reinforcement learning with robustness against uncertainty.

problem Risk-sensitive reinforcement learning with uncertainty in transition dynamics.
method Developed a risk-sensitive robust Markov decision process (RSRMDP), derived its Bellman equation, and proposed a Bayesian Dynamic Programming (Bayesian DP) algorithm.
result Demonstrated convergence to near-optimal policies and analyzed sample and computational complexities.

Persistent entropy detects phase transitions in complex systems.

problem Detecting phase transitions in complex systems.
method Established a general theorem for persistent entropy to reliably detect phase transitions, introduced operational framework for finite-time computations.
result Persistent entropy exhibits an asymptotically non-vanishing gap across phases, robust numerical signatures across experiments.

This study tackles adversarial corruption in model-based reinforcement learning.

problem Adversarial corruption in model-based reinforcement learning.
method Maximum likelihood estimation (MLE) approach for learning transition model in both online and offline settings.
result Proves a regret of ildeO(T+C) ilde{\mathcal{O}}(\sqrt{T} + C) for CR-OMLE and a suboptimality of O(C/n)\mathcal{O}(C/n) for CR-PMLE.

The stability of money value is an important requisite for a functioning economy, yet it critically depends on the actions of participants in the market themselves. Here we model the value of money as a dynamical variable that results from trading between agents. The basic trading scenario can be recast into an Ising t…

2001-10-10abs ↗pdf ↗

We propose a principled algorithm for robust Bayesian filtering and smoothing in nonlinear stochastic dynamic systems when both the transition function and the measurement function are described by non-parametric Gaussian process (GP) models. GPs are gaining increasing importance in signal processing, machine learning,…

2012-03-20abs ↗pdf ↗

Robust reinforcement learning aims to produce policies that have strong guarantees even in the face of environments/transition models whose parameters have strong uncertainty. Existing work uses value-based methods and the usual primitive action setting. In this paper, we propose robust methods for learning temporally …

2018-02-09abs ↗pdf ↗

A Robust Markov Decision Process (RMDP) is a sequential decision making model that accounts for uncertainty in the parameters of dynamic systems. This uncertainty introduces difficulties in learning an optimal policy, especially for environments with large state spaces. We propose two algorithms, RTD-DQN and Deep-RoK, …

2017-03-07abs ↗pdf ↗

New algorithm solves uncertain Markov decision processes using Wasserstein uncertainty.

problem Solving Markov decision processes with uncertain transition probabilities.
method Distributionally robust QQ-learning algorithm for Wasserstein uncertainty.
result Convergence of the algorithm proved and demonstrated with real data.

Bayesian method infers transition matrices from incomplete graph data with topological constraints.

problem Inference of transition matrices from incomplete graph data with topological constraints.
method Bayesian approach using repeated interactions and a topological prior.
result Higher accuracy in inferring transition probabilities, improving downstream tasks.

Robust Markov Decision Processes (RMDPs) intend to ensure robustness with respect to changing or adversarial system behavior. In this framework, transitions are modeled as arbitrary elements of a known and properly structured uncertainty set and a robust optimal policy can be derived under the worst-case scenario. In t…

2019-05-20abs ↗pdf ↗

A framework combining HSMM and survival analysis for lifecycle-oriented mobility analysis.

problem Understanding individual metro usage dynamics over multi-year horizons.
method A state-based lifecycle modeling framework integrating HSMM and discrete-time survival analysis.
result Identification of interpretable mobility states, transition dynamics, and state-dependent exit and re-entry processes.

FourNet approximates financial transition densities using Fourier transforms.

problem Approximating transition densities in finance with high accuracy.
method FourNet is a novel FFNN with Gaussian activation, learning from characteristic functions.
result FourNet can approximate transition densities arbitrarily well with finite neurons.

Paper develops a robust classifier for Gaussian mixture models under sparse adversarial perturbations.

problem Classifying data under sparse adversarial perturbations for Gaussian mixture models.
method Develops FilTrun algorithm with filtration and truncation modules.
result Characterizes optimal robust classifier and robust classification error.

It is important to learn various types of classifiers given training data with noisy labels. Noisy labels, in the most popular noise model hitherto, are corrupted from ground-truth labels by an unknown noise transition matrix. Thus, by estimating this matrix, classifiers can escape from overfitting those noisy labels. …

2018-05-21abs ↗pdf ↗

The paper tackles joint learning of linear systems, improving accuracy with pooled data.

problem Estimating transition matrices of multiple related linear systems more accurately.
method Developed novel techniques to bound estimation errors and establish high probability bounds for singular values.
result Significant gains in accuracy achieved by pooling data across systems.

The paper uses machine learning and Lie groups to improve rating transitions and XVA calculations.

problem Improving rating transitions and XVA calculations using machine learning and Lie groups.
method Modeling rating transitions as SDEs on Lie groups, calibrating to historical and market data, applying Girsanov theorem, and using Deep Learning.
result Improves rating transitions and XVA calculations, making the model more robust.

State entropy regularization improves robustness in reinforcement learning, especially under structured perturbations.

problem Structured and spatially correlated perturbations in reinforcement learning.
method State entropy regularization, compared to policy entropy.
result State entropy regularization provides better robustness to structured and spatially correlated perturbations.

A new method stabilizes deep reinforcement learning by using QGraphs to retain replay memory information.

problem Stabilizing model-free off-policy deep reinforcement learning with soft divergence.
method Representing past experiences as a QGraph, selecting a subgraph with favorable structure, and using lower bounds for temporal difference learning.
result QG-DDPG method is less prone to soft divergence and more robust to hyperparameters.