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

153306459612 · Jun 202019922001200920172026
48 results for controlled complexity

Complexity measures for neural nets with general activations using path-based norms.

problem Control complexity of neural networks with arbitrary activation functions.
method Approximate general activations with ReLU networks and derive path-based norms for complexity control.
result Preliminary analyses of function spaces and regularized estimators.

New method constructs Birkhoff sections for pseudo-Anosov flows with controlled complexity.

problem Constructing Birkhoff sections for pseudo-Anosov flows with specific properties.
method Uses connection between pseudo-Anosov flows and veering triangulations to explicitly construct sections with controlled complexity.
result Shows that any transitive pseudo-Anosov flow has a Birkhoff section with two boundary components.

This paper tackles adaptive control of unknown Markov jump systems with sample complexity and regret bounds.

problem Adaptive control of unknown Markov jump systems with changing dynamics.
method Identification-based adaptive control using a system identification algorithm and certainty equivalent control.
result The proposed adaptive control scheme achieves O(T)\mathcal{O}(\sqrt{T}) regret, improving to O(polylog(T))\mathcal{O}(polylog(T)) with partial knowledge.

Study nonparametric estimator for Markov chain transition matrices in offline setting.

problem Estimating transition matrices of finite controlled Markov chains from logged data.
method Developed sample complexity bounds and conditions for minimaxity.
result Achieving certain statistical risk requires balancing mixing properties and sample size.

New measure shows various training techniques control model complexity.

problem Understanding how to control model complexity in deep learning.
method Developed geometric complexity measure and demonstrated its effectiveness.
result Many training techniques control geometric complexity, providing a unified framework.

In this work, we propose a robust approach to design distributed controllers for unknown-but-sparse linear and time-invariant systems. By leveraging modern techniques in distributed controller synthesis and structured linear inverse problems as applied to system identification, we show that near-optimal distributed con…

2019-09-21abs ↗pdf ↗

Learning to control linear systems is statistically hard, especially for underactuated systems.

problem Statistical difficulty of learning to control linear systems, especially underactuated ones.
method Utilized minimax lower bounds and structural assumptions to prove learning complexity can be exponential.
result Learning complexity can be at most exponential with the controllability index of the system.

New findings on depth vs. width in neural networks, showing depth can improve learnability.

problem Understanding the role of depth in neural networks, especially when width is unbounded.
method Analyzing sample complexity for learnability in norm-controlled depth-2 and depth-3 ReLU networks.
result Depth can improve learnability of functions that are otherwise unlearnable with depth-2 networks.

This work discusses a closed-loop control strategy for complex systems utilizing scarce and streaming data. A discrete embedding space is first built using hash functions applied to the sensor measurements from which a Markov process model is derived, approximating the complex system's dynamics. A control strategy is t…

2016-04-11abs ↗pdf ↗

The paper explores when linear system identification is hard or easy, especially for under-actuated systems.

problem Statistical hardness of learning linear systems, especially under-actuated or under-excited systems.
method Using tools from minimax theory and recent statistical tools for finite sample analysis of system identification.
result The controllability index of linear systems affects the sample complexity of identification, making some systems hard to learn.

Paper proposes a DRL-based controller for networked AP systems that reduces communication frequency.

problem Reduce communication frequency in networked AP systems while maintaining control performance.
method Develops a DRL-based controller that avoids explicit update timing learning, using a semi-Markov decision process (SMDP).
result Improves communication efficiency without sacrificing control performance.

We discuss controlled connectivity properties of closed 1-forms and their cohomology classes and relate them to the simple homotopy type of the Novikov complex. The degree of controlled connectivity of a closed 1-form depends only on positive multiples of its cohomology class and is related to the Bieri-Neumann-Strebel…

2002-03-27abs ↗pdf ↗

Polynomial-time reachability for LTI systems with TLL NN controllers is achieved.

problem Bounding the reachable set of LTI systems controlled by TLL NN controllers.
method Polynomial-time computation of exact one-step reachable set and tight bounding box via two methods.
result Exact reachability computation in polynomial time for TLL NN controllers.

Deep learning solves complex stochastic control with jumps.

problem Solving high-dimensional stochastic control tasks with jumps.
method Model-based approach using two neural networks, iteratively trained with objectives derived from the Hamilton-Jacobi-Bellman equation.
result Demonstrates effectiveness in solving complex high-dimensional stochastic control tasks.

Breaks down complex nonlinear dynamics into simpler components.

problem Control of nonlinear dynamical systems remains challenging.
method Inspired by hybrid switching systems, decomposes dynamics into simpler stochastic switching linear dynamical systems.
result Extracts hierarchies of Markovian and auto-regressive locally linear controllers from nonlinear experts.

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.

A new method solves complex control problems with random coefficients.

problem Solving LQ McKean-Vlasov control problems with random coefficients.
method Decomposes the problem into two decoupled stochastic optimal control problems.
result The sum of optimal controls of auxiliary problems equals the original problem's optimal control.

Predicting outcomes and planning interactions with the physical world are long-standing goals for machine learning. A variety of such tasks involves continuous physical systems, which can be described by partial differential equations (PDEs) with many degrees of freedom. Existing methods that aim to control the dynamic…

2020-01-21abs ↗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.

CARL controls a quadruped to move naturally in complex environments.

problem Motion synthesis in dynamic environments with complex constraints.
method CARL uses GANs to adapt high-level controls to action distributions and deep reinforcement learning for dynamic recovery.
result CARL can be controlled with high-level directives and react naturally to dynamic environments.

Curriculum learning and imitation learning improve control over financial time-series data.

problem Improving control performance over complex financial time-series data.
method Data augmentation for curriculum learning and policy distillation for imitation learning.
result Curriculum learning shows significant improvement over time-series control tasks.

Collective behavior of the complex socio-economic systems is heavily influenced by the herding, group, behavior of individuals. The importance of the herding behavior may enable the control of the collective behavior of the individuals. In this contribution we consider a simple agent-based herding model modified to inc…

2013-09-24abs ↗pdf ↗

Representation learning becomes especially important for complex systems with multimodal data sources such as cameras or sensors. Recent advances in reinforcement learning and optimal control make it possible to design control algorithms on these latent representations, but the field still lacks a large-scale standard …

2018-11-27abs ↗pdf ↗

Motivated by vision-based control of autonomous vehicles, we consider the problem of controlling a known linear dynamical system for which partial state information, such as vehicle position, is extracted from complex and nonlinear data, such as a camera image. Our approach is to use a learned perception map that predi…

2019-07-08abs ↗pdf ↗

A language for specifying complex reinforcement learning tasks.

problem Challenges in specifying and shaping reward functions for complex reinforcement learning tasks.
method Proposes a new language and algorithm for automatically generating and shaping reward functions.
result SPECTRL tool outperforms state-of-the-art baselines.

PRISM infers model structures and parameters from simulations, controlling complexity at test time.

problem Choosing among large model families for scientific discovery.
method Simulation-based encoder-decoder that infers model structures and parameters, with test-time complexity control.
result PRISM scales to large model families and performs model selection in biophysical diffusion MRI.

The paper proposes a method to identify causal structure in complex dynamical systems.

problem Spurious correlations in data-driven models limit the performance of control systems.
method The method leverages controllability concepts to compute input trajectories and uses causal inference techniques.
result The method reliably identifies the true causal structure of control systems from real-world data.

New risk control method for non-monotonic losses in complex parameters.

problem Controlling risk for non-monotonic losses with multidimensional parameters.
method Stability-based guarantees for generic algorithms applied to non-monotonic losses.
result Guarantees depend on algorithm stability, with looser guarantees for unstable algorithms.

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.

This manuscript surveys reinforcement learning from the perspective of optimization and control with a focus on continuous control applications. It surveys the general formulation, terminology, and typical experimental implementations of reinforcement learning and reviews competing solution paradigms. In order to compa…

2018-06-25abs ↗pdf ↗

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.

This paper uses NLDT to find interpretable control rules from complex DRL policies.

problem Complex, non-interpretable policies from black-box AI methods.
method Evolutionary optimization of NLDT for hierarchical control rules.
result Interpretable control rules with similar performance to black-box DRL.

Optimizes control interventions in real-world networks using deep-learning and network science.

problem Optimizing control over socioeconomic networks subject to constraints.
method Integrates optimization tools from deep-learning with network science.
result Characterizes vulnerability of corporate networks to takeovers.