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

Trend · papers per month

6.3%12.5%18.8%25.0% · Oct 199319922001200920172026
48 results for controller augmentation

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.

ODVICE augments EHR cohorts using ontology to improve analysis robustness.

problem Limited records in cohorts for rare diseases hamper robust analysis.
method Ontology-driven Monte-Carlo graph spanning algorithm for data augmentation.
result ODVICE augmented cohorts show ~30% improvement in AUC over non-augmented datasets.

For training the sequence-to-sequence voice conversion model, we need to handle an issue of insufficient data about the number of speech pairs which consist of the same utterance. This study experimentally investigated the effects of Mel-spectrogram augmentation on training the sequence-to-sequence voice conversion (VC…

2020-01-06abs ↗pdf ↗

In this article, associated to a (bordered) Legendrian graph, we study and show the equivalence between two categorical Legendrian isotopy invariants: the augmentation category, a unital AA_{\infty}-category, which lifts the set of augmentations of the associated Chekanov-Eliashberg DGA, and a DG category of construct…

2019-12-23abs ↗pdf ↗

The generation of artificial data based on existing observations, known as data augmentation, is a technique used in machine learning to improve model accuracy, generalisation, and to control overfitting. Augmentor is a software package, available in both Python and Julia versions, that provides a high level API for th…

2017-08-11abs ↗pdf ↗

Curriculum learning and imitation learning improve control over financial time-series data.

problem Improving control performance over complex financial time-series data.
method Data augmentation for curriculum learning and policy distillation for imitation learning.
result Curriculum learning shows significant improvement over time-series control tasks.

To backpropagate the gradients through stochastic binary layers, we propose the augment-REINFORCE-merge (ARM) estimator that is unbiased, exhibits low variance, and has low computational complexity. Exploiting variable augmentation, REINFORCE, and reparameterization, the ARM estimator achieves adaptive variance reducti…

2018-07-30abs ↗pdf ↗

Neural networks powered with external memory simulate computer behaviors. These models, which use the memory to store data for a neural controller, can learn algorithms and other complex tasks. In this paper, we introduce a new memory to store weights for the controller, analogous to the stored-program memory in modern…

2019-05-25abs ↗pdf ↗

Bayesian classification improves with explicit aleatoric uncertainty.

problem Lack of aleatoric uncertainty representation in Bayesian classification.
method Explicitly account for aleatoric uncertainty using a Dirichlet observation model.
result Explicit aleatoric uncertainty improves performance of Bayesian neural networks.

Invariances to translation, rotation and other spatial transformations are a hallmark of the laws of motion, and have widespread use in the natural sciences to reduce the dimensionality of systems of equations. In supervised learning, such as in image classification tasks, rotation, translation and scale invariances ar…

2019-10-01abs ↗pdf ↗

Entangled bisimulation improves policy learning from visual input.

problem Learning generalizeable policies from visual input in the presence of visual distractions.
method Proposes entangled bisimulation, a bisimulation metric for continuous state and action spaces.
result Entangled bisimulation improves policy learning on the Distracting Control Suite (DCS).

Synthetic augmentation improves financial machine learning performance in variance-dominant regimes.

problem Data scarcity in financial machine learning.
method Formalized synthetic augmentation, introduced size-matched null augmentation, and developed a non-parametric block permutation test.
result Synthetic augmentation is beneficial only in variance-dominant regimes, such as persistent volatility forecasting.

Improved reinforcement learning with deep learning.

problem Extending MultiGrid Reinforcement Learning to work with deep learning.
method Combining potential-based reward shaping with a learned potential function from interaction, and adapting it for deep learning algorithms.
result DQN augmented with the approach performs significantly better on continuous control tasks.

SC-InfoNCE improves InfoNCE for feature clustering in contrastive learning.

problem Lack of theoretical understanding of InfoNCE's feature clustering mechanism.
method Introduced a transition probability matrix to model data augmentation dynamics and optimize feature similarity.
result SC-InfoNCE achieves strong performance across diverse domains, aligning feature similarity with downstream data.

Study adapts AI research methods to analyze image augmentation impacts on neural network operations.

problem Understanding how image augmentation affects neural network performance and sensitivity.
method Adapted treatment-control paradigm, uses variance decomposition, Sobol indices, and Shapley values for sensitivity analysis.
result Visualizes and quantifies sensitivity to different image augmentation parameters.

A new method tackles nonconvex optimization with penalties and proximal terms.

problem Nonconvex optimization problems with equality and inequality constraints.
method Inexact proximal augmented Lagrangian method (P-ALM) with adaptive penalty and proximal parameters.
result Effective convergence properties and numerical superiority over traditional methods.

Optimistic RL algorithms are simplified for deep RL with competitive performance.

problem Achieving accurate optimism in model-based RL for large-scale problems.
method Interpreting scalable optimistic model-based algorithms as solving a tractable noise augmented MDP.
result Competitive regret bound of ildeO(SHAT) ilde{\mathcal{O}}( |\mathcal{S}|H\sqrt{|\mathcal{A}| T } ) for Gaussian noise augmentation.

New framework explains data augmentation's role in machine learning.

problem Understanding how data augmentation affects generalization and invariance learning.
method Information-theoretic framework based on mutual information bounds and orbit-averaged loss functions.
result Derives a new generalization bound decomposing the generalization gap into three interpretable terms.

The paper provides theoretical guarantees for behavior cloning using generative models.

problem Behavior cloning of complex expert demonstrations using generative models.
method The paper proposes a theoretical framework invoking low-level controllers to stabilize imitation around expert demonstrations. It shows that with suitable low-level stability guarantees and powerful generative models, pure supervised behavior cloning can match expert trajectories.
result The paper proves that with a suitable low-level stability guarantee and a powerful enough generative model, pure supervised behavior cloning can generate trajectories matching the per-time step distribution of essentially arbitrary expert trajectories in an optimal transport cost.

ToolChain-CRC addresses the risk-control problem for retrieval-augmented and tool-using agents under drift.

problem Risk-control problem for retrieval-augmented and tool-using agents under drift.
method ToolChain-CRC uses conformal risk-control under exchangeable calibration runs.
result Trajectory-level risk control keeps accepted-trajectory risk below the target.

Paper develops heavy-tailed embeddings for better text classification and augmentation.

problem Improving text classification, especially for extreme values.
method Develops heavy-tailed embeddings using multivariate extreme value theory and introduces a scale-invariant classifier.
result The classifier outperforms baselines and generates meaningful augmented text.

Generative AI improves stock selection by synthesizing features from diverse data sources.

problem Automating feature discovery in stock market data.
method Used large language models with retrieval-augmented generation and structured prompting to synthesize features from various data sources.
result AI-generated features consistently outperform baselines, with Sharpe improvements ranging from 14% to 91%.

New findings show tool-augmented models can recall unlimited facts, outperforming purely memorized models.

problem Limitations of purely memorized models in recalling large amounts of factual information.
method Demonstrated the benefits of in-tool learning (external retrieval) over in-weight learning (memorization) for factual recall.
result Proved that tool-use enables unbounded factual recall via a simple and efficient circuit construction.

New method learns dynamics from sparse data using geometric constraints.

problem Learning dynamics from sparse, undersampled data.
method Reformulates inference as a stochastic control problem, using geometry-driven path augmentation.
result Accurately recovers stochastic dynamics from extremely undersampled data.

Paper proposes a sparse synthetic control method to select important predictors.

problem Choosing and weighting predictors affects synthetic control estimator performance.
method Sparse synthetic control procedure that penalizes predictors, derived in a linear factor model.
result Sparse synthetic control achieves lower bias and better post-treatment performance.

This paper augments the reward received by a reinforcement learning agent with potential functions in order to help the agent learn (possibly stochastic) optimal policies. We show that a potential-based reward shaping scheme is able to preserve optimality of stochastic policies, and demonstrate that the ability of an a…

2019-07-20abs ↗pdf ↗

New unsupervised learning task improves RL performance.

problem Reward-driven feature learning limitations in RL from images.
method Introduce Augmented Temporal Contrast (ATC) for unsupervised learning of image representations.
result Training encoders using ATC matches or outperforms end-to-end RL in most environments.

CODA resolves coordination issues in offline multi-agent reinforcement learning.

problem Coordination failure in offline multi-agent reinforcement learning.
method Diffusion-based multi-agent trajectory generator for data augmentation.
result CODA resolves coordination pathologies in continuous polynomial games and complex benchmarks.

This paper improves generative models by using data scaling and theoretical analysis.

problem Challenges in selecting noise distributions for stable learning in generative models.
method Introduces Scale-GAN, which uses data scaling and variance-based regularization.
result Data scaling controls the bias-variance trade-off and improves stability and accuracy.

CADD improves generative quality by augmenting discrete diffusion with continuous latent space.

problem Loss of semantic information between denoising steps in discrete diffusion models.
method Introduces a framework that augments discrete state space with a continuous latent space, allowing for graded, informative masked tokens.
result CADD improves generative quality across text generation, image synthesis, and code modeling.

Framework for estimating treatment effects using external control data.

problem Improving efficiency in estimating average treatment effects (ATE) in hybrid trials.
method Developed a formal causal inference framework based on exchangeability assumptions and graphical criteria. Proposed estimators and efficient doubly-robust methods.
result Established finite-sample performance and demonstrated application to spinal muscular atrophy trial.