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

56113169225 · Jun 202019922001200920172026
48 results for adversarial disturbances

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.

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 ↗

We introduce a new algorithm for online linear-quadratic control in a known system subject to adversarial disturbances. Existing regret bounds for this setting scale as T\sqrt{T} unless strong stochastic assumptions are imposed on the disturbance process. We give the first algorithm with logarithmic regret for arbitra…

2020-02-29abs ↗pdf ↗

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.

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.

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.

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 ↗

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.

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.

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.

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.

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.

Adversarial robustness has emerged as an important topic in deep learning as carefully crafted attack samples can significantly disturb the performance of a model. Many recent methods have proposed to improve adversarial robustness by utilizing adversarial training or model distillation, which adds additional procedure…

2019-03-23abs ↗pdf ↗

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.

Adversarial training improves linear regression solutions, offering robustness against small perturbations.

problem Vulnerability of linear models to adversarial perturbations.
method Formulated as a min-max problem, adversarial training minimizes the best solution under worst-case attacks.
result Adversarial training yields the minimum-norm interpolating solution in overparameterized models, equivalent to parameter shrinking methods in underparameterized models.

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.

This paper presents competitive algorithms for a novel class of online optimization problems with memory. We consider a setting where the learner seeks to minimize the sum of a hitting cost and a switching cost that depends on the previous pp decisions. This setting generalizes Smoothed Online Convex Optimization. The…

2020-02-13abs ↗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.

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.

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.

New algorithm achieves optimal regret in non-stochastic control, showing stochasticity is not beneficial.

problem Achieving optimal control in non-stochastic systems with adversarial noise.
method Novel online Newton step algorithm adapted to adversarial disturbances, using policy regret bounds.
result Optimal O~(T)\widetilde{\mathcal{O}}(\sqrt{T}) regret achieved in unknown dynamics, poly(logT)\mathrm{poly}(\log T) regret in known dynamics.

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 ↗

GACELA fills long gaps in musical audio with a GAN and context conditioning.

problem Restoring long gaps in musical audio with varying complexity and duration.
method Generative adversarial network (GAN) with five parallel discriminators and context conditioning.
result Reduced artifacts in inpaintings from unacceptable to mildly disturbing.

Paper tackles Byzantine attacks in Federated Learning by clustering and robustifying.

problem Adversarial attacks from Byzantine machines in Federated Learning.
method Iterative Federated Clustering Algorithm (IFCA) with trimmed mean and median aggregation.
result Improved convergence rate for strongly convex loss functions in Byzantine-Robust IFCA.

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

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.

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.