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.

169,291 papers · 148 categories

Trend · papers per month

71142212283 · Jun 202019922001200920182026
48 results for Sequential Control

Optimal control theory improves machine teaching efficiency.

problem Finding the shortest training sequence for a sequential learning algorithm to reach a target model.
method Formulated as a time-optimal control problem, leveraging optimal control theory and computational tools.
result Optimal training sequences can vastly outperform existing heuristics.

Study online data poisoning attacks in sequential training data.

problem Manipulate sequential training data to influence online learning outcomes.
method Formulated as a stochastic optimal control problem, solved with model predictive control and deep reinforcement learning.
result Upper bounds the suboptimality of attacks due to unknown data generating distribution.

New framework controls FDR for grouped features in sequential models.

problem FDR control for grouped features in sequential models.
method Grouped-feature FDR control framework for sequential and grouped models using mirror statistics and Permutation SHAP.
result FDR control for low- and high-dimensional grouped linear models and improved power under correlated signals.

Two-stage risk control for ranked retrieval systems.

problem Assessing prediction uncertainty and risk control in sequential machine learning systems.
method Developed two-stage risk control methods based on LTT and CRC frameworks, leveraging sequential nature of retrieval and ranking phases.
result The proposed methods provide theoretical guarantees and reduce computational burden compared to prior work.

Adaptive algorithm learns latent dynamical systems from sequential data.

problem Learning low-dimensional latent dynamical systems from high-dimensional sequential data.
method Combines amortized inference with path integral control to approximate inference.
result Proposed method leads to tighter lower bounds in sequential data learning.

New method controls false discoveries in real-time data streams.

problem Online testing of hypotheses with strict error constraints and no future data.
method Structure-adaptive sequential testing (SAST) with alpha-investment algorithm.
result Substantial power gain over existing online testing rules.

Controller-Augmented Hidden Markov Models (CHMMs) are a framework for constrained sequential inference.

problem Hidden Markov models fail under pathwise constraints like precedence, visitation, or monotonic state progression.
method CHMMs compile constraints into finite-state controllers, then use standard forward-backward and Viterbi recursions to compute exact constrained posteriors and paths.
result CHMMs provide exact constrained inference, monotone ascent in constrained EM, and linear complexity in controller cardinality.

We solve a broad class of sequential decision-making problems with partially observed states.

problem Sequential decision-making under uncertainty with partially observed states.
method Modeling as a partially observed Markov decision process (POMDP) and separating state and modulation process.
result The approach allows for specialized approximate solution procedures.

ComiRec framework predicts user interests for personalized recommendations.

problem Predicting user interests from sequential behavior data.
method ComiRec framework captures multiple user interests and balances recommendation accuracy and diversity.
result ComiRec achieves significant improvements over state-of-the-art models in sequential recommendation.

Improved diffusion models using energy distillation and sequential Monte Carlo.

problem Training instability and inferior performance in energy parameterized diffusion models.
method Introduced a novel training regime for energy functions through distillation of pre-trained diffusion models, and cast the sampling procedure as a Feynman Kac model.
result Demonstrated improved performance and new sampling techniques.

Solves high-dimensional observation learning for control models.

problem Learning dynamics from high-dimensional images is challenging.
method Proposes a Beta DVBF approach to handle latent and observable space discrepancies.
result Demonstrates improved model learning from high-dimensional observations.

This study improves audit sampling by using sequential procedures with statistical guarantees.

problem Improving audit efficiency and reliability with statistical methods.
method Formulated as a sequential testing problem, defining null and alternative hypotheses, stopping and decision rules, and exact boundary conditions.
result Exact design yields ex ante control of decision error probabilities, and simulation-based implementation approximates this design.

Paper explores a new model for non-Markovian control learning.

problem Sequential control learning with delayed rewards in partially observable environments.
method Gated End-to-End Memory Policy Network (GEMPN) using value-based algorithms.
result Encouraging results show the model's capability in non-Markovian decision processes.

New method optimizes memory usage in neural networks, improving sequential learning.

problem Current memory models in neural networks waste memory and computation.
method Formulated an optimization problem to maximize information storage, introduced Cached Uniform Writing.
result Proved Cached Uniform Writing optimizes memory usage and outperforms other methods.

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.

The paper tackles control policy learning for unknown systems using convex optimization.

problem Learning control policies for unknown linear dynamical systems to maximize a quadratic reward function.
method Sequential convex programming to optimize expected reward over posterior system parameter distribution.
result The method achieves reliable local convergence and robust stability, demonstrated with strong performance and robustness in simulations and real-world applications.

New algorithm resists attacks, deletions, and failures in sequential system optimization.

problem Resilient sequential design in adversarial environments.
method First scalable algorithm for system-wide resiliency, adaptiveness, and provable approximation.
result Guaranteed solution close to optimal for monotone objective functions.

Hamiltonian RNN controls hidden states gradient for long-term dependencies.

problem Challenges in learning long-term dependencies in RNNs.
method Symplectic discretization of Hamiltonian system to control gradient.
result Hamiltonian RNN outperforms other RNNs without hyperparameter optimization.

One way to solve lasso problems when the dictionary does not fit into available memory is to first screen the dictionary to remove unneeded features. Prior research has shown that sequential screening methods offer the greatest promise in this endeavor. Most existing work on sequential screening targets the context of …

2016-08-21abs ↗pdf ↗

Combines control variates and adaptive importance sampling for Monte Carlo integration.

problem Improving Monte Carlo integration accuracy with control variates and adaptive sampling.
method A quadrature rule combining control variates and adaptive importance sampling.
result Non-asymptotic bound on the probabilistic error of the procedure.

We propose and analyze sequential design methods for the problem of ranking several response surfaces. Namely, given L2L \ge 2 response surfaces over a continuous input space X\cal X, the aim is to efficiently find the index of the minimal response across the entire X\cal X. The response surfaces are not known and ha…

2015-09-03abs ↗pdf ↗

Reduces change detection to estimation using confidence sequences.

problem Detecting changes in data streams with minimal delay and false alarms.
method Reduction from sequential change detection to sequential estimation using confidence sequences.
result Change detection scheme with minimal structural assumptions and strong guarantees.

A PID-based feedback-control system improves multiple KPIs in RTB display advertising.

problem Challenges in simultaneously improving multiple KPIs in RTB campaigns.
method Sequential Control using PID-based feedback and importance metrics.
result Effective in simultaneously controlling multiple KPIs in both simulations and live traffic.

Paper develops a framework for learning interpretable representations of sequential decision behavior.

problem Obtaining a transparent description of existing behavior.
method Inverse decision modeling framework, formalizing both forward and inverse problems.
result Learning interpretable representations of behavior, including suboptimal actions, biased beliefs, and imperfect knowledge.

Detects data drift in deep learning models using neural embeddings.

problem Detecting changes in data distribution in deep learning models.
method Formulates drift detection in a sequential decision framework and introduces a loss function to balance false alarms and quick detection.
result Demonstrates improved ability to balance false alarms and quick detection in change detection.

Develops a new framework for analyzing sequential decision-making problems using information theory.

problem Lack of information-theoretic generalization bounds for sequential decision-making problems.
method Introduces a sequential supersample framework that separates learner filtration from proof-side enlargement, controlling the generalization gap by sequential CMI.
result Establishes a sequential CMI that controls the generalization gap in sequential decision-making problems.

New method disentangles perceptual uncertainty and behavioral costs in partially observable systems.

problem Tackles inverse optimal control for non-linear partially observable systems.
method Probabilistic approach using maximum causal entropy formulations and local linearization.
result Disentangles perceptual factors and behavioral costs in sequential decision-making.

Adaptive sequential testing optimizes epidemic control by learning optimal test strategies.

problem Optimizing test allocation in epidemics with network and temporal dependence.
method Adaptive sequential design with Online Super Learner for optimal test strategies.
result Superior performance in simulated university COVID-19 pandemic.

New method optimizes portfolios by dynamically integrating ESG constraints.

problem Static ESG scores mismatch sequential portfolio decisions.
method MACF-X, a family of adapters that learns ESG costs from multimodal evidence.
result Reduces tail ESG budget pressure while maintaining financial performance.

A new method uses ABC-SMC to infer hybrid models in bioprocesses with limited data.

problem Inference of hybrid models in bioprocesses with limited real data and high uncertainties.
method Approximate Bayesian Computation with Sequential Monte Carlo (ABC-SMC) and linear Gaussian dynamic Bayesian network (LG-DBN) for posterior distribution approximation.
result The method accelerates hybrid model inference and supports process monitoring and robust control.

New method recalibrates VaR for option books, reducing forecast errors.

problem Inaccurate VaR forecasts due to missing operational choices.
method Marking-aware sequential VaR recalibration targeting normalized book-level loss.
result Sequential VaR recalibration improves VaR performance across different markets and options.