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

306090120 · Jun 202019922001200920172026
48 results for trajectory feedback

Robot motions in the presence of humans should not only be feasible and safe, but also conform to human preferences. This, however, requires user feedback on the robot's behavior. In this work, we propose a novel approach to leverage the user's brain signals as a feedback modality in order to decode the judgment of rob…

2019-09-03abs ↗pdf ↗

Study shows reinforcement learning is possible with once-per-episode feedback.

problem Challenges of reinforcement learning with sparse feedback.
method Introduced a model where trajectory labels are generated by an unknown parametric model and developed an algorithm for sublinear regret.
result Achieved sublinear regret with a statistically and computationally efficient algorithm.

Unified LP framework for offline reward learning from human demonstrations and feedback.

problem Reward learning from human demonstrations and feedback with robustness and sample efficiency.
method A novel linear programming framework for offline reward learning.
result Unified LP framework achieves better performance compared to MLE.

Proposes a new theoretical framework for PbRL that requires less human feedback.

problem Lack of theoretical work capturing practical PbRL frameworks.
method Introduces a reward-agnostic PbRL framework that acquires exploratory trajectories before human feedback.
result Demonstrates improved sample complexity for learning optimal policies in linear and low-rank MDPs.

Algorithm for online decision making with unknown dynamics and aggregate feedback.

problem Online decision making with unknown dynamics and aggregate bandit feedback.
method Developed an algorithm based on online mirror descent with a self-concordant barrier regularization and an increasing learning rate schedule.
result Achieved O(K)O(\sqrt{K}) regret for the online Markov Decision Process with KK episodes.

Meta-algorithm for efficient reinforcement learning from human preferences.

problem Learning from human preference comparisons in Markov decision processes.
method Randomized exploration and experimental design for batch comparison queries.
result Meta-algorithm achieves both regret and last-iterate guarantees with minimal preference queries.

This work presents a methodology to design trajectory tracking feedback control laws, which embed non-parametric statistical models, such as Gaussian Processes (GPs). The aim is to minimize unmodeled dynamics such as undesired slippages. The proposed approach has the benefit of avoiding complex terramechanics analysis …

2018-10-08abs ↗pdf ↗

Learning weights in a spiking neural network with hidden neurons, using local, stable and online rules, to control non-linear body dynamics is an open problem. Here, we employ a supervised scheme, Feedback-based Online Local Learning Of Weights (FOLLOW), to train a network of heterogeneous spiking neurons with hidden l…

2017-12-29abs ↗pdf ↗

Deep neural nets approximate random dynamical system trajectories uniformly in time.

problem Approximating trajectories of random dynamical systems over infinite time horizons.
method Recurrent neural networks with simple feedback structures.
result Certain random trajectories can be approximated uniformly in time to any desired accuracy.

We consider the problem of learning from sparse and underspecified rewards, where an agent receives a complex input, such as a natural language instruction, and needs to generate a complex response, such as an action sequence, while only receiving binary success-failure feedback. Such success-failure rewards are often …

2019-02-19abs ↗pdf ↗

RLHF fails when humans only partially observe, leading to inflated or overjustified feedback.

problem Failure of reinforcement learning from human feedback in partially observable environments.
method Formal definition of failure cases, modeling human as Boltzmann rational, analyzing information provided by feedback.
result RLHF can deceptively inflate or overjustify feedback when humans have partial observations.

Algorithm learns NE in imperfect information games with imperfect feedback.

problem Learning Nash equilibrium in imperfect information games with bandit feedback.
method IXOMD algorithm for model-free learning with 1/T1/\sqrt{T} convergence rate.
result IXOMD achieves 1/T1/\sqrt{T} convergence rate to NE.

Autoregressive state transitions, where predictions are conditioned on past predictions, are the predominant choice for both deterministic and stochastic sequential models. However, autoregressive feedback exposes the evolution of the hidden state trajectory to potential biases from well-known train-test discrepancies.…

2019-08-30abs ↗pdf ↗

A new method infers neural trajectories in real-time, improving experimental design.

problem Real-time inference of neural trajectories for immediate feedback.
method Exponential family variational Kalman filter (eVKF) for online learning.
result eVKF achieves competitive performance on synthetic and real-world data.

We study control systems invariant under a Lie group with application to the problem of nonlinear trajectory planning. A theory of symmetry reduction of exterior differential systems is employed to demonstrate how symmetry reduction and reconstruction is effective in the explicit, exact construction of planned system t…

2015-10-20abs ↗pdf ↗

Geometric framework for dynamic feedback linearization of control systems with symmetry.

problem Dynamic feedback linearization of control systems with symmetry.
method Geometric framework based on Lie symmetry, systematic procedure for all smooth, generic system trajectories.
result Sufficient condition for dynamic feedback linearizability obtained.

New budget quantifies drift in closed-loop learning, improving reproducibility.

problem Characterizing statistical learning under distributional drift in closed-loop settings.
method Introduces an intrinsic drift budget CTC_T quantifying cumulative information-geometric motion of the data distribution.
result Proves a drift-feedback bound of order T1/2+CT/TT^{-1/2}+C_T/T for prequential reproducibility, up to controlled second-order remainder terms.

Paper analyzes online reinforcement learning with outcome-based feedback, providing efficient algorithms and fundamental limits.

problem Assigning credit to actions in reinforcement learning with only endpoint rewards.
method Develops a provably sample-efficient algorithm for online reinforcement learning with general function approximation.
result Achieves O(CmcovH3/ε2)O(C_{ m cov} H^3/ε^2) sample complexity, characterizing statistical separation between outcome-based and per-step rewards.

Trajectory-level supervision allows efficient offline reinforcement learning.

problem Offline reinforcement learning
method Developing a statistical theory for offline policy optimization from trajectory-level labels
result Proving a high-probability guarantee of order O~(H2Csa(π)/n)\widetilde O(H^2\sqrt{C_{sa}(\pi^\star)/n})

Model predicts multi-agent trajectories using a differentiable simulator.

problem Predicting future positions of multiple interacting agents.
method Conditional recurrent variational neural networks (CVRNNs) with a kinematic bicycle model.
result Achieves state-of-the-art results on INTERACTION dataset.

Adaptive OMD reduces variance in learning optimal strategies for imperfect information games.

problem High variance in learning optimal strategies for imperfect information games.
method Fixed sampling approach with locally applied Online Mirror Descent (OMD) algorithm.
result Convergence rate of ildeO(T1/2) ilde{\mathcal{O}}(T^{-1/2}) with high probability.

In preference-based reinforcement learning (RL), an agent interacts with the environment while receiving preferences instead of absolute feedback. While there is increasing research activity in preference-based RL, the design of formal frameworks that admit tractable theoretical analysis remains an open challenge. Buil…

2019-08-04abs ↗pdf ↗

This thesis tackles learning reward functions from human comparative feedback.

problem Designing reward functions for complex tasks is challenging and humans often provide suboptimal demonstrations.
method Proposes learning reward functions from comparative feedback (pairwise comparisons, best-of-many choices, rankings, scaled comparisons) and active learning techniques.
result Demonstrates the effectiveness of learning reward functions from comparative feedback in various domains.

For sophisticated reinforcement learning (RL) systems to interact usefully with real-world environments, we need to communicate complex goals to these systems. In this work, we explore goals defined in terms of (non-expert) human preferences between pairs of trajectory segments. We show that this approach can effective…

2017-06-12abs ↗pdf ↗

Interactive learning with hindsight instruction feedback achieves better performance than traditional methods.

problem Learning with expert supervision of optimal responses is often impractical or requires expert knowledge.
method Study of interactive learning with hindsight instruction feedback, introducing LORIL algorithm.
result LORIL algorithm achieves T\sqrt{T} regret, improving over baselines in domains with low-rank instruction-response distribution.

Paper develops methods to optimize policies directly from human feedback without reward inference.

problem Challenges in RLHF, including reward model overfitting and distribution shift.
method Develops two algorithms for RLHF without reward inference, using zeroth-order gradient approximators.
result Establishes polynomial convergence rates and outperforms existing methods in numerical experiments.

Agents learn to outperform in trading by using past and current prices.

problem Optimal trading performance beyond theoretical limits.
method Two-agent Almgren-Chriss liquidation game, schedule-learning, DDQN architectures.
result Agents with access to past and current prices achieve supra-competitive outcomes.

A new framework uses stochastic optimal control to estimate rare events more accurately.

problem Estimating rare events like chemical reactions in biomolecules is computationally challenging.
method The approach casts committor estimation as a stochastic optimal control problem, developing direct and off-policy Value Matching losses.
result The framework yields more accurate committor estimates, reaction rates, and equilibrium constants.

Imitation learning is a control design paradigm that seeks to learn a control policy reproducing demonstrations from expert agents. By substituting expert demonstrations for optimal behaviours, the same paradigm leads to the design of control policies closely approximating the optimal state-feedback. This approach requ…

2019-01-07abs ↗pdf ↗

This paper introduces a hierarchical associative memory model with multiple layers.

problem Limitations of traditional associative memory models with only one hidden layer.
method Develops a fully recurrent model with arbitrary layers, including locally connected ones, and a corresponding energy function.
result The model can dynamically assemble memories using weights from lower layers and higher layers' rules.

New RLHF algorithm identifies optimal policies from human feedback without explicit reward inference.

problem Training large language models with human feedback without reward inference.
method Model-free RLHF algorithm BSAD\mathsf{BSAD} that identifies optimal policies directly from human preference.
result Provable, instance-dependent sample complexity ildeO(cMSA3H3Mlog1δ) ilde{\mathcal{O}}(c_{\mathcal{M}}SA^3H^3M\log\frac{1}δ).