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

77154230307 · Jun 202019922001200920172026
48 results for arbitrary control

Hybrid controller combines model-based and policy-based reinforcement learning.

problem Combining model-based and policy-based reinforcement learning for stability and robustness.
method Designs a hybrid controller that interpolates a model-based linear controller and a differentiable policy.
result Proven to maintain stability and universal approximation properties.

We are given a video of a person performing a certain activity, from which we extract a controllable model. The model generates novel image sequences of that person, according to arbitrary user-defined control signals, typically marking the displacement of the moving body. The generated video can have an arbitrary back…

2019-04-17abs ↗pdf ↗

We develop a method for user-controllable semantic image inpainting: Given an arbitrary set of observed pixels, the unobserved pixels can be imputed in a user-controllable range of possibilities, each of which is semantically coherent and locally consistent with the observed pixels. We achieve this using a deep generat…

2018-06-15abs ↗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 ↗

We investigate whether a robot arm can learn to pick and throw arbitrary objects into selected boxes quickly and accurately. Throwing has the potential to increase the physical reachability and picking speed of a robot arm. However, precisely throwing arbitrary objects in unstructured settings presents many challenges:…

2019-03-27abs ↗pdf ↗

Paper tackles overestimation bias in continuous control, improving performance by 25%.

problem Overestimation bias in off-policy learning.
method Truncated Quantile Critics (TQC) combines distributional representation, truncation, and ensembling of critics.
result TQC outperforms state-of-the-art methods by 25% on the Humanoid environment.

In this paper, we derive curvature estimates for strongly stable hypersurfaces with constant mean curvature immersed in Rn+1\mathbb{R}^{n+1}, which show that the locally controlled volume growth yields a globally controlled volume growth if M=\partial M=\emptyset. Moreover, we deduce a Bernstein-type theorem for complete…

2012-12-14abs ↗pdf ↗

A new convenient method of describing flat convex compact sets is proposed. It generalizes classical trigonometric functions sin\sin and cos\cos. Apparently, this method may be very useful for explicit description of solutions of optimal control problems with two-dimensional control. Using this method a series of sub-Fin…

2018-07-21abs ↗pdf ↗

IG-RL learns adaptive traffic signals for any network, outperforming existing methods.

problem Adaptive traffic signal control for large networks with combinatorial state and action spaces.
method Graph-Convolutional Networks for decentralized, flexible control.
result IG-RL generalizes to new networks and traffic conditions without additional training.

Method predicts hardware resource usage by control software with guaranteed linear convergence.

problem Predicting time-varying hardware resource availability in control software.
method Path structured multimarginal Schrödinger bridge (MSBP) for learning stochastic resource usage.
result Guaranteed linear convergence to accurate prediction of hardware resource utilization.

Motivated by control-affine systems in optimal control theory, we introduce the notion of a point-affine distribution on a manifold X - i.e., an affine distribution F together with a distinguished vector field contained in F. We compute local invariants for point-affine distributions of constant type when dim(X)=n, ran…

2009-03-30abs ↗pdf ↗

This is an introductory chapter in a series in which we take a systematic study of the Yang-Mills equations on curved space-times. In this first, we provide standard material that consists in writing the proof of the global existence of Yang-Mills fields on arbitrary curved space-times using the Klainerman-Rodnianski p…

2013-12-19abs ↗pdf ↗

This paper tackles inventory control with general arrival dynamics and post-processing, improving profitability.

problem Inventory control with arbitrary arrival dynamics and post-processing constraints.
method Formulated as an exogenous decision process, incorporating deep generative models for arrivals, and applying supervised learning techniques.
result Improves profitability over production baselines and real-world A/B test data.

We consider the problem of asynchronous online testing, aimed at providing control of the false discovery rate (FDR) during a continual stream of data collection and testing, where each test may be a sequential test that can start and stop at arbitrary times. This setting increasingly characterizes real-world applicati…

2018-12-12abs ↗pdf ↗

LineFlow is a framework for training RL agents to control production lines.

problem Designing control systems for production lines is challenging.
method Introduces LineFlow, an extensible Python framework for simulating and training RL agents.
result RL agents approach optimal performance in well-understood scenarios but face challenges in complex industrial lines.

Paper proposes method for optimal control of unknown systems with latent states.

problem Jointly estimating dynamics and latent states in systems with unmeasurable states.
method Combination of particle Markov chain Monte Carlo methods and scenario theory.
result Probabilistic performance guarantees for optimal input trajectories.

Finite resources limit false discovery rate control in structured hypothesis spaces.

problem Controlling false discovery rate in hypothesis testing with finite data and structured hypothesis spaces.
method Framework for exact FDR control and adaptive power maximization.
result Exact FDR control and adaptive power maximization.

Paper proposes SCALLION and SCAFCOM for compressed FL with reduced communication.

problem Reducing communication overhead in Federated Learning with data heterogeneity and partial participation.
method Revisit and simplify stochastic controlled averaging, proposing SCALLION and SCAFCOM for unbiased and biased compression.
result SCALLION and SCAFCOM outperform existing methods in communication and computation complexities.

In this paper, two Q-learning (QL) methods are proposed and their convergence theories are established for addressing the model-free optimal control problem of general nonlinear continuous-time systems. By introducing the Q-function for continuous-time systems, policy iteration based QL (PIQL) and value iteration based…

2014-10-11abs ↗pdf ↗

Nonparametric IPSS selects features with false discovery control.

problem Feature selection in high-dimensional data with theoretical false discovery control.
method Integrated Path Stability Selection (IPSS) applied to nonparametric feature importance scores.
result IPSS accurately controls false discovery rate and detects more true positives than existing methods.

We show LLMs can be locally linear, enabling better control of activations.

problem Suboptimal control of LLM activations during generation.
method Model LLM inference as a linear dynamical system, compute feedback controllers using Jacobians, and adapt classical control theory.
result Robust, fine-grained control of LLM activations across models and tasks.

We frame the problem of selecting an optimal audio encoding scheme as a supervised learning task. Through uniform convergence theory, we guarantee approximately optimal codec selection while controlling for selection bias. We present rigorous statistical guarantees for the codec selection problem that hold for arbitrar…

2018-12-18abs ↗pdf ↗

New method controls false discoveries in online testing with deadlines.

problem Controlling false discoveries in online hypothesis testing with decision deadlines.
method Benjamini-Hochberg-type procedure over a moving window of hypotheses with adaptive threshold parameters.
result Controls false discovery rate at every stage and adaptively chosen stopping times.

We provide faster algorithms for the problem of Gaussian summation, which occurs in many machine learning methods. We develop two new extensions - an O(Dp) Taylor expansion for the Gaussian kernel with rigorous error bounds and a new error control scheme integrating any arbitrary approximation method - within the best …

2012-06-27abs ↗pdf ↗

New bounds for SA with arbitrary norm contractions and Markovian noise.

problem Finite-time analysis of two-time-scale stochastic approximation with arbitrary norm contractions and Markovian noise.
method Use of generalized Moreau envelope for arbitrary norm contractions and solutions of Poisson equation for Markovian noise.
result Mean square error decays at rates of O(1/n2/3)O(1/n^{2/3}) and O(1/n)O(1/n) under different conditions.

A new method models continuous-time counterfactual outcomes using neural controlled differential equations.

problem Estimating personalized healthcare outcomes over irregularly sampled data.
method Interpreting data as samples from a continuous-time process, modeling latent trajectory using controlled differential equations, and using adversarial training for time-dependent confounding.
result TE-CDE consistently outperforms existing approaches in irregularly sampled scenarios.

We provide the first differentially private algorithms for controlling the false discovery rate (FDR) in multiple hypothesis testing, with essentially no loss in power under certain conditions. Our general approach is to adapt a well-known variant of the Benjamini-Hochberg procedure (BHq), making each step differential…

2015-11-12abs ↗pdf ↗

Optimizes exploration for nonlinear systems to learn controllers efficiently.

problem Learning optimal controllers for unknown nonlinear systems.
method Formally quantifies which parameters are most critical, and develops an algorithm to efficiently explore these parameters.
result Proves a near-instance-optimal rate for learning controllers.

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.

The paper proves the existence of H-spheres with arbitrary codimensions in certain Riemannian manifolds.

problem Existence of H-spheres with arbitrary codimensions in closed Riemannian manifolds.
method Min-max theory and Morse index analysis.
result Existence of branched immersed H-spheres with controlled Morse index and arbitrary codimensions.