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

157314470627 · Jun 202019922001200920172026
48 results for State Feedback

Develops a new model for RLHF accounting for partially observed states and intermediate feedback.

problem Lack of models for partially observed states and intermediate feedback in RLHF.
method PORRL model with cardinal and dueling feedback methods.
result Demonstrates improved learning and alignment with new model-based and model-free methods.

Study of reinforcement learning with additional feedback observations.

problem Episodic reinforcement learning in Markov decision processes with feedback observations.
method Formalization of feedback graph, model-based algorithms leveraging feedback, regret bound analysis.
result Regret bound depends only on the size of the maximum acyclic subgraph of the feedback graph.

Algorithm improves query recommendations with immediate user feedback.

problem Lack of adaptability to immediate user feedback in query recommendation algorithms.
method Augmented transformer-based causal language models with multi-armed bandit framework.
result Substantial improvement in per-round regret compared to state-of-the-art models.

Learning from human feedback is a viable alternative to control design that does not require modelling or control expertise. Particularly, learning from corrective advice garners advantages over evaluative feedback as it is a more intuitive and scalable format. The current state-of-the-art in this field, COACH, has pro…

2019-03-12abs ↗pdf ↗

The problem of Reinforcement Learning (RL) in an unknown nonlinear dynamical system is equivalent to the search for an optimal feedback law utilizing the simulations/ rollouts of the dynamical system. Most RL techniques search over a complex global nonlinear feedback parametrization making them suffer from high trainin…

2020-02-21abs ↗pdf ↗

This work compares human feedback methods for reward learning in bandits.

problem Understanding how human feedback affects the performance of reward learning methods.
method Theoretical comparison of human feedback approaches in offline contextual bandits.
result Human bias and uncertainty in feedback modeling impact the theoretical guarantees of reward learning methods.

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 ↗

New Q-learning algorithms reduce regret in inventory control problems.

problem Efficiently learning optimal policies in inventory control problems with limited feedback.
method Proposed Elimination-Based Half-Q-Learning (HQL) and Full-Q-Learning (FQL) algorithms with theoretical regret bounds.
result HQL incurs ildeO(H3T) ilde{\mathcal{O}}(H^3\sqrt{ T}) regret, FQL incurs ildeO(H2T) ilde{\mathcal{O}}(H^2\sqrt{ T}) regret, independent of state and action space sizes.

Study uses geometric algebra to analyze credit cycles, revealing dangerous feedback loops.

problem Understanding and predicting dangerous feedback loops in credit cycles.
method Represent economic states as multi-vectors in Clifford algebra, focusing on bivector elements for rotational coupling.
result Geometric relationship between unemployment and credit contraction shifts from simple correlation to dangerous rotational dynamics during crises.

We study an online decision making problem where on each round a learner chooses a list of items based on some side information, receives a scalar feedback value for each individual item, and a reward that is linearly related to this feedback. These problems, known as contextual semibandits, arise in crowdsourcing, rec…

2015-02-20abs ↗pdf ↗

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 ↗

Paper introduces a new framework for optimizing non-convex functions.

problem Optimizing non-convex functions, especially DR-submodular and concave functions.
method Developed a general meta-algorithm to convert linear/quadratic optimization to optimization of upper-linearizable/quadratizable functions.
result Unified approach to concave and DR-submodular optimization problems.

Study controlled contagion with state-dependent killing, proving a comparison principle.

problem Analyzing controlled McKean--Vlasov contagion with state-dependent killing.
method Proof of a comparison principle using Wasserstein smooth-gauge comparison and killing-jump absorption estimates.
result Established a comparison principle for the two-population killed-particle HJB.

CNN-F uses generative feedback to improve neural networks' robustness to perturbations.

problem Neural networks' vulnerability to input perturbations like noise and attacks.
method Enforces self-consistency in neural networks by incorporating generative recurrent feedback.
result CNN-F shows significantly improved adversarial robustness compared to conventional CNNs.

Paper models and compresses wideband CSI feedback in FDD MIMO systems.

problem Fundamental limits of channel state information (CSI) feedback in FDD massive MIMO systems.
method Modeling CSI as a Gaussian-mixture source with latent geometry states, proposing Gaussian-mixture transform coding (GMTC).
result Near-optimal CSI compression achieved through state-adaptive transform coding without large neural encoders.

Massive multiple-input multiple-output (MIMO) systems require downlink channel state information (CSI) at the base station (BS) to better utilize the available spatial diversity and multiplexing gains. However, in a frequency division duplex (FDD) massive MIMO system, CSI feedback overhead degrades the overall spectral…

2019-10-23abs ↗pdf ↗

Framework learns robust control policies from expert demonstrations.

problem Adversarial robustness and closed-loop generalization in feedback control policies.
method Lipschitz-constrained loss minimization for certified robustness and generalization.
result Finite sample bound on policy learning error and robust closed-loop stability.

AI assistants often give convincing but incorrect responses to match user beliefs.

problem Sycophancy in AI assistants that use human feedback.
method Examined five AI assistants across four tasks, analyzed human preference data, and compared model outputs against preference models.
result Sycophancy is a general behavior of AI assistants, driven in part by human preference judgments.

We propose a novel spectral convolutional neural network (CNN) model on graph structured data, namely Distributed Feedback-Looped Networks (DFNets). This model is incorporated with a robust class of spectral graph filters, called feedback-looped filters, to provide better localization on vertices, while still attaining…

2019-10-24abs ↗pdf ↗

PCTS optimizes noisy, delayed, multi-fidelity feedbacks in black-box optimization.

problem Optimizing unknown functions with noisy, delayed, and multi-fidelity feedbacks.
method ProCrastinated Tree Search (PCTS) with DUCB1 and DUCBV algorithms.
result PCTS achieves better regret bounds for delayed, noisy, and multi-fidelity feedbacks.

Agents trained in simulation may make errors in the real world due to mismatches between training and execution environments. These mistakes can be dangerous and difficult to discover because the agent cannot predict them a priori. We propose using oracle feedback to learn a predictive model of these blind spots to red…

2018-05-23abs ↗pdf ↗

New algorithm reduces reinforcement learning regret for linear MDPs with unknown transitions.

problem Adversarial linear mixture MDPs with bandit feedback and unknown transition.
method Proposes a new algorithm with a least square estimator and self-normalized concentration.
result Achieves improved regret bound with high probability.