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

128256384512 · Jun 202019922001200920172026
48 results for disturbance effects

Study examines how disturbances affect financial returns in Austrian forests.

problem Financial impact of disturbances on timberland returns in Austria.
method Applied probability theory to analyze two management regimes: even-aged and semi-stationary.
result Severe disturbances can lead to a shift from continuous-cover to even-aged forestry, affecting financial sensitivity.

The paper analyzes how disturbances affect the convergence of algorithms in complex systems.

problem Analyzing the impact of disturbances on algorithm convergence in complex systems.
method Leveraging converse Lyapunov theorems, the paper derives stability bounds and convergence rates in the presence of disturbances.
result Key inequalities quantify the impact of disturbances on algorithmic performance.

Safe exploration method for RL under disturbance ensures safety with probabilistic guarantees.

problem Safe reinforcement learning in real environments with disturbance.
method Uses partial prior knowledge and conservative inputs to ensure state constraint satisfaction.
result Guaranteed safety with pre-specified probability in the presence of stochastic disturbance.

New approach generates optimal disturbances for controller verification.

problem Optimizing disturbances for controller verification with blackbox access.
method Online learning approach that adaptively generates disturbances based on controller inputs.
result New algorithm (MOTR) outperforms existing methods in simulated examples.

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.

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.

Bayesian method optimizes rescheduling for multipurpose batch processes with incomplete look-ahead information.

problem Optimizing rescheduling for multipurpose batch processes under incomplete look-ahead information.
method Proposes a Bayesian dynamic scheduling method that learns from disturbances and updates schedules online.
result Achieves statistically better long-term costs and system nervousness compared to existing periodic rescheduling strategies.

EGFC learns from streaming data to classify power quality disturbances.

problem Real-time detection and classification of power quality disturbances.
method Evolving Gaussian Fuzzy Classification (EGFC) framework with semi-supervised learning.
result Encouraging classification results from online data streams.

Paper revisits set membership estimation for linear systems with relaxed disturbance bounds.

problem Set membership estimation for linear systems with disturbances bounded by convex sets.
method Adopted block-martingale small-ball condition and random perturbed control policies to establish convergence rates.
result Established convergence rates for disturbances bounded by general convex sets.

New algorithm achieves logarithmic regret for adversarial online control.

problem Online linear-quadratic control in systems with adversarial disturbances.
method Characterization of optimal offline control law, reduced to online learning with approximate advantage functions.
result First algorithm with logarithmic regret for arbitrary adversarial disturbance sequences.

We study the control of a linear dynamical system with adversarial disturbances (as opposed to statistical noise). The objective we consider is one of regret: we desire an online control procedure that can do nearly as well as that of a procedure that has full knowledge of the disturbances in hindsight. Our main result…

2019-02-23abs ↗pdf ↗

New method identifies network dynamics and noise structure.

problem Estimating network and disturbance topologies in dynamic systems.
method Extended multi-step Sequential Linear Regression and Weighted Null Space Fitting methods.
result Consistent estimation of dynamic networks with reduced computational burden.

Paper develops online learning-based risk-averse MPC for uncertain systems.

problem Designing robust MPC for systems with unknown but inferable stochastic disturbances.
method Proposes a novel online learning framework using CVaR constraints and Dirichlet process mixture models.
result Demonstrates improved robustness and adaptability of MPC in handling time-varying disturbance distributions.

New method controls linear systems with partial info and disturbances.

problem Controlling linear dynamical systems under partial observation and adversarial disturbances.
method Double Spectral Control (DSC) using two-level spectral approximation strategy.
result Matches best known regret guarantees with exponential runtime improvement.

Asynchronous Advantage Actor Critic (A3C) is an effective Reinforcement Learning (RL) algorithm for a wide range of tasks, such as Atari games and robot control. The agent learns policies and value function through trial-and-error interactions with the environment until converging to an optimal policy. Robustness and s…

2019-12-01abs ↗pdf ↗

Develops robust MDPs for unknown disturbances with performance guarantees.

problem Unknown disturbance distribution in MDPs.
method Empirical distribution, sublevel set of distance function, weak convergence, concentration inequality.
result Robust optimal value function converges to true optimal value function with increasing sample sizes.

Paper proposes tensor-based method for semiconductor manufacturing process control.

problem Challenges of traditional process control methods in high-dimensional image-based overlay errors.
method Builds a high-dimensional process model, proposes tensor-on-vector regression algorithms, designs EWMA controller for tensor data.
result The method reduces overlay errors using limited control recipes and is superior especially when disturbances are not stable.

In this work we seek for an approach to integrate safety in the learning process that relies on a partly known state-space model of the system and regards the unknown dynamics as an additive bounded disturbance. We introduce a framework for safely learning a control strategy for a given system with an additive disturba…

2018-11-09abs ↗pdf ↗

A method to minimize regret in multi-agent control systems with adversarial disturbances.

problem Optimal control of dynamical systems with adversarial disturbances and multiple agents.
method Reduction from online convex optimization to a distributed algorithm for multi-agent control.
result The resulting distributed algorithm has low regret relative to the optimal precomputed joint policy.

Neural SVEs model complex systems with memory, outperforming traditional methods.

problem Modeling systems with memory effects and irregular behavior.
method Introducing neural stochastic Volterra equations as a physics-inspired architecture.
result Neural SVEs outperform neural SDEs and DeepONets in various applications.

SOOTT framework optimizes target tracking with robust and learning-augmented algorithms.

problem Optimizing target tracking in dynamic environments with adversarial perturbations.
method Integrates robust and learning-augmented algorithms for online decision-making.
result CoRT learning-augmented algorithm strictly improves over robust BEST when predictions are accurate.

Paper reduces sample complexity for bilinear systems identification to nearly constant.

problem Identifying discrete-time bilinear systems under bounded disturbances.
method Uses trajectory-dependent regressors and polynomial mean-square state growth analysis.
result Proves sample complexity of O~(1/ε)\widetilde{\mathcal O}(1/ε) for estimation error εε.

Adversarial training improves linear regression solutions, revealing sparsity and abrupt interpolation.

problem Adversarial attacks on linear regression models.
method Formulated as a convex problem, adversarial training is used to find robust solutions that are sparse and interpolate data.
result Adversarial training with small disturbances gives the solution with the minimum-norm that interpolates the training data, revealing abrupt transition into interpolation.

New method uses small perturbations to improve representation learning from few labels.

problem Stability issues and label scarcity in representation learning.
method Introduces small-perturbation ideology on representation probability distribution models.
result Proposed models show better performance in clustering compared to baseline methods.

New framework boosts neural network performance and resilience.

problem Susceptibility of compact neural network implementations to system disturbances.
method Realistic crossbar simulations and Mosaics framework to re-use synaptic connections.
result Compact neural networks are noise-immune and perform well under disturbances.

Framework learns robust control policies from expert demonstrations.

problem Adversarial robustness and closed-loop generalization in feedback control policies.
method Lipschitz-constrained loss minimization for certified robustness and generalization.
result Finite sample bound on policy learning error and robust closed-loop stability.

By taking into account the nonlinear effect of the cause, the inner noise effect, and the measurement distortion effect in the observed variables, the post-nonlinear (PNL) causal model has demonstrated its excellent performance in distinguishing the cause from effect. However, its identifiability has not been properly …

2012-05-09abs ↗pdf ↗

This work uses QPGPs to improve ILC performance in repetitive tasks.

problem Performance degradation in repetitive motion tasks due to environmental changes and robot wear.
method Incorporates Quasi-Periodic Gaussian Processes into a predictive ILC framework.
result The proposed approach achieves faster convergence and robustness under disturbances.

Paper develops a neural-fuzzy controller for GPS-intelligent buoys.

problem Optimally track dynamically positioned marine buoys with unknown parameters.
method Dynamic system modeling using neural-fuzzy networks with backstepping technique.
result The controller minimizes position errors and adjusts buoy positions accurately.

New method relaxes optimization problems to find solutions more reliably.

problem Optimizing functions with stochastic or non-differentiable elements.
method Using measure theory and Fourier analysis to impose structure on optimization problems.
result Consistency of optimal values, Lipschitzness of gradients, and convexity are key traits for fast and reliable optimization.

Graph neural networks detect structural perturbations from time series data.

problem Detecting structural causes of disturbances in complex systems.
method Graph neural network approach to infer structural perturbations from functional time series.
result Data-driven approach outperforms typical reconstruction methods and meets Bayesian inference accuracy.

Optimistic Q-learning reduces sample complexity for systems with known dynamics.

problem Sample efficiency in reinforcement learning with partial dynamics knowledge.
method Optimistic Q-learning algorithm for systems with additive disturbance model.
result Achieves ildeO(extPoly(H)T) ilde{\mathcal{O}}( ext{Poly}(H)\sqrt{T}) regret under perfect knowledge of dynamics.

In recent years, several methods have been proposed for the discovery of causal structure from non-experimental data (Spirtes et al. 2000; Pearl 2000). Such methods make various assumptions on the data generating process to facilitate its identification from purely observational data. Continuing this line of research, …

2012-07-04abs ↗pdf ↗