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

82163245326 · May 202619922001200920172026
48 results for discrete control

Improved text generation with constraints using discrete auto-regressive biasing.

problem Balancing fluency and constraint satisfaction in LLM outputs.
method Discrete Auto-regressive Biasing, leveraging gradients in discrete text space.
result Significantly improved constraint satisfaction with comparable fluency.

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.

Optimizes control of noisy discrete systems without system matrix knowledge.

problem Optimal control of discrete-time systems with additive and multiplicative noises.
method Stochastic Lyapunov and Riccati equations, model-free reinforcement learning.
result Model-free reinforcement learning algorithm converges to optimal control policy.

A new method reduces variance in training discrete latent variable models.

problem High variance in stochastic gradient estimators for discrete latent variable models.
method Double control variates for score function estimators using Taylor expansions.
result Our method can have lower variance compared to other estimators.

Efficient deep policy gradient method for continuous-time control problems.

problem Optimal control in continuous time with fine time discretization.
method Multi-scale deep policy gradient method with varying time discretization.
result Targeted efficiency in computational resources achieved through multi-scale approach.

Paper formulates mutual information optimal control for discrete-time systems.

problem Optimal control of discrete-time linear systems with mutual information.
method Formulates MIOCP as an extension of MEOCP, derives optimal policy and prior, proposes alternating minimization algorithm.
result Proposes an alternating minimization algorithm for MIOCP.

SOM-VQ tokenizes discrete models with semantic structure and navigable topology.

problem Lack of semantic structure in vector quantized representations limits interpretable human control.
method Combines vector quantization with Self-Organizing Maps to learn discrete codebooks with explicit topology.
result SOM-VQ produces more learnable token sequences and provides an explicit navigable geometry in code space.

Unified framework extends adjoint Schrödinger bridge sampler to discrete spaces.

problem Challenges in learning discrete neural samplers due to gradients and combinatorial complexity.
method Introduces discrete ASBS, a unified framework that extends adjoint Schrödinger bridge sampler to discrete spaces.
result Empirically, discrete ASBS achieves competitive sample quality with significant advantages in training efficiency and scalability.

Study scaling limits of utility indifference prices in discretized Bachelier model.

problem Analyzing utility indifference prices for path-dependent European options in a discretized Bachelier model.
method Purely probabilistic approach, including duality argument, optimal drift control problem, martingale techniques, and strong invariance principles.
result Obtained a scaling limit for utility indifference prices as the number of trading times increases.

A simpler edge-based discretization method without dual volumes.

problem Efficiently computing edge-based discretization vectors without forming dual volumes.
method Directly compute edge-midpoint vectors and reduce dual volume formation.
result Significant reduction in computing time for tetrahedral grids.

New insights into RL efficiency from managing time discretization.

problem The impact of time discretization on RL methods in continuous-time systems.
method Analysis of Monte-Carlo policy evaluation for LQR systems.
result An optimal choice of temporal resolution for a given data budget improves policy evaluation efficiency.

New boundary and point constraints for controlling conformal surfaces.

problem Controlling the geometry of surfaces defined by minimizers of conformal variational problems.
method Introducing new boundary conditions, point constraints, and flux constraints to control the metric and conformal scale factor.
result Introduces intuitive controls for exploring a subspace of conformal immersions.

The paper tackles exact linearization and control of flat discrete-time systems.

problem Exact linearization and control of flat nonlinear discrete-time systems.
method Investigates conditions for choosing new inputs and feedbacks that may depend on forward-shifts of the new input.
result Easily verifiable conditions for choosing a feasible input and a new input that minimizes forward-shifts of the flat output.

Hybrid RL method optimizes trading by balancing continuous and discrete actions.

problem Optimal execution in algorithmic trading with continuous-discrete action space.
method Combines continuous and discrete RL agents for better trading decisions.
result Significantly outperforms existing methods in trading efficiency and stability.

Reinforcement learning (RL) in discrete action space is ubiquitous in real-world applications, but its complexity grows exponentially with the action-space dimension, making it challenging to apply existing on-policy gradient based deep RL algorithms efficiently. To effectively operate in multidimensional discrete acti…

2020-02-10abs ↗pdf ↗

New estimators reduce variance in training variational autoencoders with discrete latent variables.

problem Training variational autoencoders with discrete latent variables requires efficient gradient estimation.
method Introduce ReinMax-Rao and ReinMax-CV estimators using Rao-Blackwellisation and control variates.
result Demonstrate superior performance on training variational autoencoders with discrete latent spaces.

Safety filter for unknown discrete-time systems with learned models and noise covariance.

problem Ensuring safety for unknown discrete-time linear systems with Gaussian noise.
method Develops a learning-based safety filter using empirical model and noise covariance, optimizing control actions to stay within safety constraints.
result Minimally modifies nominal control actions to ensure safety with high probability, tightening constraints as more data is collected.

To better understand and improve the behavior of neural networks, a recent line of works bridged the connection between ordinary differential equations (ODEs) and deep neural networks (DNNs). The connections are made in two folds: (1) View DNN as ODE discretization; (2) View the training of DNN as solving an optimal co…

2019-11-01abs ↗pdf ↗

We present a framework for learning disentangled and interpretable jointly continuous and discrete representations in an unsupervised manner. By augmenting the continuous latent distribution of variational autoencoders with a relaxed discrete distribution and controlling the amount of information encoded in each latent…

2018-03-31abs ↗pdf ↗

New method controls gradient error for sparse MRFs.

problem Efficient learning for sparse discrete MRFs with NP-hard inference.
method Stochastic proximal gradient (SPG) with controlled gradient approximation error.
result Novel bounds control gradient approximation quality.

Paper proposes adaptive control for unknown systems using reinforcement learning.

problem Adaptive control for unknown, linearizable systems.
method On-policy reinforcement learning for discrete-time, stochastic systems.
result Stability and tracking errors concentrate near zero with high probability.

MDNS generates samples from complex discrete distributions efficiently.

problem Learning neural samplers for discrete state spaces with multi-modal distributions.
method A novel framework using stochastic optimal control of continuous-time Markov chains.
result MDNS outperforms other methods in generating accurate samples from high-dimensional, multi-modal distributions.

Hybrid systems are characterized by having an interaction between continuous dynamics and discrete events. The contribution of this paper is to provide hybrid systems with a novel geometric formulation so that controls can be added. Using this framework we describe some new global controllability tests for hybrid contr…

2019-05-07abs ↗pdf ↗

Paper introduces a new method for risk-sensitive investment management using RL.

problem Risk-sensitive portfolio management with unknown model parameters.
method Combines RL and risk-sensitive stochastic control with Gaussian perturbations for exploration.
result Endogenous relative-entropy regularization and optimal investment strategy derived.

In this paper we propose a new methodology for solving an uncertain stochastic Markovian control problem in discrete time. We call the proposed methodology the adaptive robust control. We demonstrate that the uncertain control problem under consideration can be solved in terms of associated adaptive robust Bellman equa…

2017-06-07abs ↗pdf ↗