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,694 papers · 148 categories

Trend · papers per month

168337505673 · Jun 202019922001200920172026
48 results for randomized control inputs

Framework combines random features with CDEs for efficient time-series learning.

problem Efficient training of time-series models with strong inductive bias.
method Random Fourier CDEs and Random Rough DEs using continuous-time reservoirs and log-ODE discretization.
result Unified perspective on random-feature reservoirs and path-signature theory.

Study on estimating unstable open-loop matrices from state trajectories.

problem System identification for stochastic continuous-time dynamics.
method Employing randomized control inputs to estimate unstable open-loop matrix.
result Estimation error decays with trajectory length, signal-to-noise ratio, and excitability.

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.

Gaussian processes (GPs) provide flexible distributions over functions, with inductive biases controlled by a kernel. However, in many applications Gaussian processes can struggle with even moderate input dimensionality. Learning a low dimensional projection can help alleviate this curse of dimensionality, but introduc…

2019-12-30abs ↗pdf ↗

Synthetic data can amplify privacy in linear regression models.

problem Understanding how synthetic data can enhance privacy in linear regression models.
method Investigated through the linear regression framework, analyzing synthetic data generated from random inputs and controlled inputs.
result Releasing a limited number of synthetic data points amplifies privacy beyond the model's inherent guarantees when inputs are random, but not when inputs are controlled by an adversary.

Reconstructing signature features from randomized vector fields in differential equations.

problem Reconstructing signature features from controlled differential equations with random vector fields.
method Using controlled ordinary differential equations driven by continuous bounded variation curves, the study explores the extent to which signature features can be reconstructed from the non-linear flow of these equations.
result The number of signature features that can be reconstructed from the non-linear flow of controlled ordinary differential equations with random vector fields is exponential in the hidden dimension, under certain conditions.

We study empirical covariance matrices in finance. Due to the limited amount of available input information, these objects incorporate a huge amount of noise, so their naive use in optimization procedures, such as portfolio selection, may be misleading. In this paper we investigate a recently introduced filtering proce…

2005-09-28abs ↗pdf ↗

We consider the problem of online adaptive control of the linear quadratic regulator, where the true system parameters are unknown. We prove new upper and lower bounds demonstrating that the optimal regret scales as Θ~(du2dxT)\widetildeΘ({\sqrt{d_{\mathbf{u}}^2 d_{\mathbf{x}} T}}), where TT is the number of time steps, $d_{\m…

2020-01-27abs ↗pdf ↗

The paper provides a non-asymptotic error bound for linear system identification under nonlinear policies.

problem System identification for linear systems with nonlinear and/or time-varying policies under i.i.d. random excitation noises.
method Least square estimation with non-asymptotic error bound for bounded state and action trajectories.
result The error bound is consistent with linear policies and generalizes existing guarantees.

New method uses DNN for genetic variant identification, controlling randomness and improving interpretability.

problem Challenges in interpreting deep neural networks for genetic variant identification.
method Interpretable neural network model with controlled variable selection using ensembling, knockoffs, and de-randomization.
result The proposed method leads to more discoveries compared to conventional methods.

Recently introduced generative adversarial network (GAN) has been shown numerous promising results to generate realistic samples. The essential task of GAN is to control the features of samples generated from a random distribution. While the current GAN structures, such as conditional GAN, successfully generate samples…

2017-08-02abs ↗pdf ↗

We explore a new method for discrete-time control problems using randomization and entropy.

problem Discrete-time linear-exponential quadratic Gaussian (LEQG) control problem.
method Introduce exploration through randomization and apply duality between free energy and relative entropy.
result Reduced LEQG problem to equivalent risk-neutral LQG control problem with entropy regularization.

Randomized control methods improve asset pricing and performance analysis.

problem Challenges in drawing inferences from traditional random portfolios in performance evaluation.
method Geometric random walks and Markov chain Monte Carlo methods to construct flexible control groups.
result Captured premia associated with size, value, quality, and momentum in a constrained setting.

Many random processes can be simulated as the output of a deterministic model accepting random inputs. Such a model usually describes a complex mathematical or physical stochastic system and the randomness is introduced in the input variables of the model. When the statistics of the output event are known, these input …

2012-11-20abs ↗pdf ↗

Extremely accurate prediction of dynamical system bifurcations using control inputs.

problem Predicting complex bifurcation structures in dynamical systems.
method Extending extreme learning machines with control inputs to model system dynamics.
result The model can nearly reproduce the entire structure of bifurcations using only a few parameter values.

Quantum Process Tomography (QPT) methods aim at identifying, i.e. estimating, a given quantum process. QPT is a major quantum information processing tool, since it especially allows one to characterize the actual behavior of quantum gates, which are the building blocks of quantum computers. However, usual QPT procedure…

2019-09-18abs ↗pdf ↗

ParK efficiently solves kernel ridge regression for large datasets.

problem Large-scale kernel ridge regression efficiency and accuracy.
method Partitioning feature space with random projections and iterative optimization.
result Provably maintains statistical accuracy with reduced space and time complexity.

The thesis presents a new perspective on high-dimensional optimization.

problem The failure point of classical optimization methods in high dimensions.
method A distributional view of optimization, focusing on random objective functions and Bayesian Optimization.
result The distributional view explains predictable progress in high-dimensional optimization and provides insights into optimal step size control.

Over-parameterized neural networks generalize well in practice without any explicit regularization. Although it has not been proven yet, empirical evidence suggests that implicit regularization plays a crucial role in deep learning and prevents the network from overfitting. In this work, we introduce the gradient gap d…

2019-03-05abs ↗pdf ↗

Optimal control of stochastic nonlinear dynamical systems is a major challenge in the domain of robot learning. Given the intractability of the global control problem, state-of-the-art algorithms focus on approximate sequential optimization techniques, that heavily rely on heuristics for regularization in order to achi…

2019-10-07abs ↗pdf ↗

A new approach models exploration in continuous-time RL using random measures.

problem Modeling exploration in continuous-time reinforcement learning.
method Random measure approach to control execution in continuous-time RL.
result Grid-sampling limit SDE can replace existing models for theoretical analysis and learning algorithms.

New method certifies neural network robustness under random input noise.

problem Certifying neural network robustness against random input noise.
method Chance-constrained optimization problem reformulated with input-output samples, convex conditions developed.
result Proposed method certifies robustness against various input noise regimes over larger uncertainty regions.

Method generates anatomically-controllable medical images with segmentation guidance.

problem Challenging to enforce anatomical constraints in generated medical images.
method Segmentation-guided diffusion models with random mask ablation training.
result New state-of-the-art in faithfulness to input anatomical masks.

The paper analyzes deep neural networks using control theory to set a time limit for their convergence.

problem Understanding the finite-time convergence of deep neural networks.
method Lyapunov based analysis of the loss function, control theory framework, finite-time control of non-linear systems.
result A priori guarantees of finite-time convergence for deep neural networks are provided.

We learn linear models from nonlinear systems using multiple trajectories and regularization.

problem Identifying linear models from data when the underlying dynamics are nonlinear.
method Multiple trajectories data acquisition followed by regularized least squares.
result Learn linearized dynamics with arbitrarily small error given enough samples.

We propose an input design method for a general class of parametric probabilistic models, including nonlinear dynamical systems with process noise. The goal of the procedure is to select inputs such that the parameter posterior distribution concentrates about the true value of the parameters; however, exact computation…

2019-03-06abs ↗pdf ↗