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

120240359479 · Jun 202019922001200920172026
48 results for Kernelized Linear Regulator

Paper uses Koopman operator and Nyström method for efficient nonlinear control.

problem Control of nonlinear dynamical systems.
method Combines Koopman operator framework with Nyström approximation for kernel methods.
result Theoretical guarantees on the convergence rates of the approximated Riccati operator and regulator objective.

Finding optimal feedback controllers for nonlinear dynamic systems from data is hard. Recently, Bayesian optimization (BO) has been proposed as a powerful framework for direct controller tuning from experimental trials. For selecting the next query point and finding the global optimum, BO relies on a probabilistic desc…

2017-09-20abs ↗pdf ↗

Policy gradient converges to globally optimal policy in nearly linear-quadratic systems.

problem Finding optimal policies in nonlinear control systems with partial information.
method Policy gradient algorithm designed for nearly linear-quadratic regulators with small Lipschitz nonlinear components.
result Policy gradient algorithm converges to globally optimal policy with linear rate.

This paper analyzes how randomizing rewards in MBRL can improve performance without being overly optimistic.

problem The gap between theoretical worst-case regret analysis and empirical performance in MBRL.
method Reward randomization in model-based reinforcement learning (MBRL) with kernelized linear regulator (KNR) model.
result Reward randomization guarantees partial optimism and near-optimal worst-case regret.

Distribution grids are currently challenged by frequent voltage excursions induced by intermittent solar generation. Smart inverters have been advocated as a fast-responding means to regulate voltage and minimize ohmic losses. Since optimal inverter coordination may be computationally challenging and preset local contr…

2018-07-10abs ↗pdf ↗

Regularization techniques are widely used to improve the generality, robustness, and efficiency of deep convolutional neural networks (DCNNs). In this paper, we propose a novel approach of regulating DCNN convolutional kernels by a structured filter bank. Comparing with the existing regularization methods, such as $\el…

2019-07-25abs ↗pdf ↗

New algorithm learns LQR with O(T)O(\sqrt{T}) regret using Langevin dynamics and excitation.

problem Learning LQR with a O(T)O(\sqrt{T}) regret bound.
method Thompson sampling with Langevin dynamics and excitation mechanism.
result Achieved O(T)O(\sqrt{T}) regret bound for LQR learning.

Regulating causal effects through averaged constraints fails to enforce conditional independence.

problem Enforcing conditional independence in regulatory and analytic settings.
method Formulated causal masking as a linear program and analyzed the resulting enforcement problem from both regulator and optimizer perspectives.
result Averaged-constraint optimization often violates stratum-wise requirements while satisfying the averaged one exactly, and detection requires conditional-independence tests.

We study the constrained linear quadratic regulator with unknown dynamics, addressing the tension between safety and exploration in data-driven control techniques. We present a framework which allows for system identification through persistent excitation, while maintaining safety by guaranteeing the satisfaction of st…

2018-09-26abs ↗pdf ↗

Efficiently solves exploration-exploitation in LQR using Lagrangian relaxation.

problem Exploration-exploitation dilemma in linear quadratic regulator (LQR) setting.
method Relax optimistic optimization into a constrained extended LQR problem, then solve using Riccati equations.
result Computes εε-optimistic controller efficiently with O(log(1/ε))O\big(\log(1/ε)\big) Riccati equations.

The main challenge for adaptive regulation of linear-quadratic systems is the trade-off between identification and control. An adaptive policy needs to address both the estimation of unknown dynamics parameters (exploration), as well as the regulation of the underlying system (exploitation). To this end, optimism-based…

2017-11-20abs ↗pdf ↗

This work establishes safe reinforcement learning for LQR with nonlinear baselines.

problem Safe reinforcement learning in LQR with unknown dynamics and safety constraints.
method General framework for nonlinear baselines, focusing on 1D spaces.
result Achieves optimal regret bounds for constrained reinforcement learning.

Policy gradient methods converge for LQR problems with noisy state dynamics.

problem Finding optimal policies in noisy LQR problems over finite time horizons.
method Policy gradient methods with convergence guarantees for finite time and stochastic state dynamics.
result Global linear convergence for policy gradient methods in LQR problems with weak assumptions.

Proposes a novel network-based neighborhood regression for biological systems.

problem Lack of comprehensive analysis on biological modules using both global and local network data.
method Develops a community-wise least square optimization approach to analyze gene modules and their regulatory strength.
result Achieves exact minimax optimality and linear consistency in identifying gene module associations.

The paper analyzes financial networks with default charges and defines a model using fixpoint problems.

problem Modeling systemic risk in interbank networks with crossholdings and default charges.
method Mixed integer-linear programming and Gaussian elimination algorithm for computing clearing pairs.
result Developed methods to compute maximal and minimal clearing pairs.

New bounds for adaptive control in high dimensions without fixed state space.

problem Adaptive control of linear systems in high or infinite dimensions.
method Novel perturbation bound for certainty equivalence, scaling with prediction error.
result First regret bounds for LQR in infinite dimensional systems, independent of ambient dimension.

New classifier combines locally linear kernels for fast and accurate non-linear classification.

problem Developing a fast and accurate non-linear classifier.
method Combines locally linear classifiers using a 1\ell_1 Multiple Kernel Learning (MKL) problem with scalable MKL training for streaming kernels.
result The resulting classifier achieves high accuracy with fast inference time.

Optimal dynamic allocation of carbon allowances reduces emissions efficiently.

problem Reducing carbon emissions from firms over time with dynamic allocation and trading.
method Variational approach to solve the Stackelberg game between regulator and firms.
result Optimal policies lead to constant abatement effort and allowance price, outperforming static allocations.

Deleting data from a trained machine learning (ML) model is a critical task in many applications. For example, we may want to remove the influence of training points that might be out of date or outliers. Regulations such as EU's General Data Protection Regulation also stipulate that individuals can request to have the…

2020-02-24abs ↗pdf ↗

We construct a canonical correspondence from a wide class of reproducing kernels on infinite-dimensional Hermitian vector bundles to linear connections on these bundles. The linear connection in question is obtained through a pull-back operation involving the tautological universal bundle and the classifying morphism o…

2012-06-18abs ↗pdf ↗

Model proposes how regulators should oversee complex algorithms in high-stakes applications.

problem Regulating complex algorithms used in high-stakes applications like lending, testing, and hiring.
method Proposes a model where regulators are limited in learning about complex algorithms with misaligned preferences, and explores different regulatory approaches.
result Complex algorithms can improve welfare, but regulation should focus on the source of incentive misalignment for optimal results.

Regulator allocates buffers to prevent financial contagion in networks with common assets.

problem Containment of default contagion in financial networks with common asset exposures.
method Allocates nonnegative buffer vectors under linear budget constraints to maximize default or insolvency resilience margins or minimize worst-case systemic losses.
result Exact synthesis results for buffer allocation under \ell_{\infty} and 1\ell_{1} uncertainty sets, showing significant gains over uniform and exposure-proportional allocations.

Strong inductive biases prevent harmless interpolation in overparameterized models.

problem Understanding the conditions under which overparameterized models can interpolate noise without overfitting.
method Theoretical analysis of high-dimensional kernel regression and deep neural networks, focusing on the role of inductive biases.
result The strength of an estimator's inductive bias determines whether interpolation is harmless or requires fitting noise for good generalization.

Regulated curves on Banach manifolds with continuous projections and regulated derivatives are studied.

problem Regulated curves on Banach manifolds with continuous projections and regulated derivatives.
method Building a Banach manifold structure on the set of such curves.
result Existence of a 'local addition' on such a manifold for any Banach manifold.

Appropriate traffic regulations, e.g. planned road closure, are important in congested events. Crowd simulators have been used to find appropriate regulations by simulating multiple scenarios with different regulations. However, this approach requires multiple simulation runs, which are time-consuming. In this paper, w…

2018-10-23abs ↗pdf ↗

Study task-guided exploration in linear dynamical systems, improving sample complexity.

problem Efficiently learning about an environment to complete a specific task.
method Proposed a computationally efficient experiment-design based exploration algorithm.
result Optimally explores the environment, collecting precise information needed to complete the task.

We show that any objective risk measurement algorithm mandated by central banks for regulated financial entities will result in more risk being taken on by those financial entities than would otherwise be the case. Furthermore, the risks taken on by the regulated financial entities are far more systemically concentrate…

2010-04-10abs ↗pdf ↗

Kernel methods and MLPs perform similarly to linear models in high dimensions.

problem Understanding the performance of kernel methods and MLPs in high-dimensional settings.
method Analysis of kernel methods and MLPs in a high-dimensional regime with proportional asymptotics.
result Linear models are optimal in high-dimensional settings when data is generated by kernel models with nonlinear relationships.

The paper explores AI in finance, focusing on XAI's role in enhancing interpretability and trust.

problem The need for AI in finance and the importance of XAI for better decision-making.
method Tracing AI's evolution in finance, highlighting XAI's role, and demonstrating through simulations.
result XAI enhances trust in AI systems, leading to more responsible decision-making.