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

Trend · papers per month

6.3%12.5%18.8%25.0% · Oct 199319922001200920172026
48 results for Target Control

A new pricing controller handles resource constraints to infer target prices effectively.

problem Resource constraints prevent fixed-price inference, leading to support exclusion.
method Formalizes support-exclusion failure, designs a target-aware controller, and uses a realized information clock.
result The controller can certify feasible target bands and log continuous local densities, leading to polynomial rates of inference.

Method improves volatility targeting for index construction.

problem High turnover, leverage spikes, and sensitivity to estimation error in existing volatility-targeting strategies.
method Proportional-control approach for setting index weights that corrects tracking error through feedback.
result The proportional-control approach achieves the target volatility more effectively than open-loop alternatives.

Study bond market making with hit-ratio target using optimal control and HJB equations.

problem Optimizing bond market making with hit-ratio target in OTC markets.
method Stochastic optimal control approach, dualizing hit-ratio target, HJB equation, Riccati equation, linearization.
result Explicit quote decompositions into riskless spread, inventory-risk correction, and hit-ratio correction.

In this paper, we adapt stochastic Perron's method to analyze a stochastic target problem with unbounded controls in a jump diffusion set-up. With this method, we construct a viscosity sub-solution and super-solution to the associated Hamiltonian-Jacobi-Bellman (HJB) equations. Under comparison principles, uniqueness o…

2016-04-13abs ↗pdf ↗

Policy-gradient method controls multiple non-cohesive targets.

problem Controlling multiple non-cohesive targets in a decentralized manner.
method Proximal Policy Optimization for target selection and driving.
result Effective control of non-cohesive targets without prior dynamics knowledge.

New approach to control diffusion processes with soft constraints.

problem Finding an optimal diffusion process with a target terminal distribution.
method Generalized Schrödinger bridge problem with soft constraints, solving for a geometric mixture of target and other distributions.
result The terminal distribution of the optimally controlled process is a geometric mixture of the target and another distribution.

A novel framework synthesizes treatment data across sites using optimal transport.

problem Estimating treatment effects across different sites with varying conditions.
method Distributional causal inference, Optimal Transport for alignment of control group distributions.
result Synthetic treatment group data aligns with true target distribution under general conditions.

Differentially private synthetic control estimates treatment effects while protecting privacy.

problem Estimating treatment effects on sensitive data without revealing individual information.
method Combines non-private synthetic control and differentially private empirical risk minimization.
result Private synthetic control produces accurate predictions with minimal privacy cost.

Jeffrey guidance extends diffusion-model control to more complex applications.

problem Controlling diffusion models beyond simple cases like conditional sampling.
method Leveraging Jeffrey's rule of conditioning to update marginal distributions towards a target distribution.
result Significant reductions in FID on CIFAR-10 and FFHQ with Inception embeddings as the target.

We study a stochastic game where one player tries to find a strategy such that the state process reaches a target of controlled-loss-type, no matter which action is chosen by the other player. We provide, in a general setup, a relaxed geometric dynamic programming principle for this problem and derive, for the case of …

2012-06-27abs ↗pdf ↗

New method constructs synthetic treatment groups without mean exchangeability assumption.

problem Violations of mean exchangeability assumption in randomized controlled trials.
method Weighted mixture of treatment groups from source populations, minimizing conditional maximum mean discrepancy.
result Asymptotic normality of synthetic treatment group estimator established.

Optimizes electric field to control molecule states in Hartree-Fock theory.

problem Optimizing electric field to drive molecule from initial to target state.
method Trust region optimization with gradients from adjoint state method.
result Achieves desired target states with minimal control effort.

Study uses multi-agent reinforcement learning to control self-assembly with high-resolution external control.

problem Designing effective external control protocols for self-assembly with high-resolution control.
method Investigated a multi-agent reinforcement learning approach, comparing fully decentralized and partially decentralized strategies.
result Partially decentralized approach outperforms fully decentralized in controlling self-assembly towards target structures.

Extends driving model to control agent behavior in simulations.

problem Simulate realistic driving behavior for autonomous systems.
method Introduces Control-ITRA method to influence agent behavior through waypoint assignment and target speed modulation.
result Demonstrates controllable, infraction-free trajectories while preserving realism.

This paper tackles data-efficient nonlinear control in Hamiltonian systems using symplectic geometry.

problem Data-efficient nonlinear control in Hamiltonian systems.
method Combines symplectic geometry, recurrence on energy level sets, and chain policies to solve target reachability problems.
result Data requirements depend on geometric and recurrence properties of the Hamiltonian, not the state dimension.

New model-based methods adapt pre-trained policies to unseen environments efficiently.

problem High sample complexity in reinforcement learning limits practical applications.
method Combines online learning and adaptive control to adapt policies in unseen environments.
result Proves policies can quickly recover trajectories from source to target environments.

We observe that several existing policy gradient methods (such as vanilla policy gradient, PPO, A2C) may suffer from overly large gradients when the current policy is close to deterministic (even in some very simple environments), leading to an unstable training process. To address this issue, we propose a new method, …

2019-05-27abs ↗pdf ↗

New approach transfers rewards learned in one environment to reinforcement learning in a new environment.

problem Transfer of rewards learned using inverse reinforcement learning from one environment to a new, different environment.
method Formulate the problem as a joint system of Bellman equations, develop minimax estimators for the target soft-qq-function, solve the source and target system of equations jointly.
result The coupled approach removes the first-order influence of source Bellman residual error compared to the sequential approach.

A drone catches another agile drone using competitive reinforcement learning.

problem Intercepting an agile drone with another agile drone.
method Formulated as a Competitive Reinforcement Learning problem, trained with PPO, using a high-fidelity simulation environment.
result Trained policies outperform common heuristic baselines in catch rate, time to catch, and crash rate.

Visualizes movement control optimization landscapes to understand why it's hard and how to make it easier.

problem Understanding and optimizing movement control problems in animation research.
method Novel visualizations of high-dimensional control optimization landscapes.
result Trajectory optimization becomes increasingly ill-conditioned with longer trajectories, while parameterizing control as partial target states can act as an efficient preconditioner.

This work proposes a model to disentangle image factors effectively and control their manipulation.

problem Controlling disentanglement during image editing while preserving object identity.
method Encoder-decoder architecture with decorrelation regularization and soft target representations.
result The model successfully disentangles image factors and manipulates them effectively.

Estimates target GGM using auxiliary studies with false discovery rate control.

problem Estimating high-dimensional GGMs from related studies.
method Transfer learning with Trans-CLIME and debiased Trans-CLIME estimators.
result Debiased Trans-CLIME estimator provides element-wise asymptotic normality and false discovery rate control.

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.

Develops diffusion samplers for target distributions with efficient score and density estimates.

problem Estimating scores and densities for time-varying distributions.
method Sequential Monte Carlo with diffusion paths and control variates.
result Effective samplers for time-varying distributions with theoretical guarantees and practical applications.

Central bank strategy to maintain currency exchange rate within limits.

problem Maintaining a currency exchange rate within a target zone despite adverse economic trends.
method Modeling the problem with a continuous-time market impact model and solving it as a stochastic control problem.
result Optimal strategy minimizes accumulated inventory of foreign currency.

The issue of fairness in machine learning models has recently attracted a lot of attention as ensuring it will ensure continued confidence of the general public in the deployment of machine learning systems. We focus on mitigating the harm incurred by a biased machine learning system that offers better outputs (e.g. lo…

2018-10-12abs ↗pdf ↗

We propose and analyze an alternate approach to off-policy multi-step temporal difference learning, in which off-policy returns are corrected with the current Q-function in terms of rewards, rather than with the target policy in terms of transition probabilities. We prove that such approximate corrections are sufficien…

2016-02-16abs ↗pdf ↗

A new control chart detects shifts in binary data streams quickly and reliably.

problem Early detection of small shifts in multiple binary data streams.
method Cumulative Standardized Binomial EWMA (CSB-EWMA) chart with exact variance derivation.
result Adaptive control limits ensure robust detection across different data distributions.

In this work, we introduce a novel class of adaptive Monte Carlo methods, called adaptive independent sticky MCMC algorithms, for efficient sampling from a generic target probability density function (pdf). The new class of algorithms employs adaptive non-parametric proposal densities which become closer and closer to …

2013-08-17abs ↗pdf ↗