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

Trend · papers per month

265277103 · Jun 202019922001200920182026
48 results for Non-linear Feedback

A neural network learns to control a two-link arm with non-linear dynamics.

problem Training spiking neural networks to control complex, non-linear systems.
method Feedback-based Online Local Learning Of Weights (FOLLOW) to train a network of spiking neurons with hidden layers.
result The network learns an inverse model of the arm's dynamics and uses it to generate a motor command for control.

DART optimizes subset selection in non-linear bandit problems.

problem Optimizing subset selection in non-linear bandit problems with correlated rewards.
method DART algorithm for combinatorial bandits without individual arm feedback or linearity assumption.
result DART achieves a regret bound of ildeO(KKNT) ilde{\mathcal{O}}(K\sqrt{KNT}).

New algorithm for choosing top-K options efficiently with linear space and non-linear feedback.

problem Choosing the best K out of N options at each time instant with efficient trade-off between exploration and exploitation.
method CMAB-SM algorithm, divide-and-conquer strategy, linear space, non-linear feedback.
result Achieves a sub-linear regret bound of $O(K^{ rac{1}{2}}N^{ rac{1}{3}}T^{ rac{2}{3}})$.

Master-slave architecture tackles combinatorial multi-armed bandits with diversity constraints.

problem Solving top-KK combinatorial multi-armed bandits with non-linear feedback and diversity constraints.
method Master-slave architecture with six slave models, teacher learning, and policy co-training.
result Significantly outperforms existing algorithms in synthetic and real datasets.

A predictor that is deployed in a live production system may perturb the features it uses to make predictions. Such a feedback loop can occur, for example, when a model that predicts a certain type of behavior ends up causing the behavior it predicts, thus creating a self-fulfilling prophecy. In this paper we analyze p…

2013-10-10abs ↗pdf ↗

Neural algorithms optimize arm selection with human preference feedback for complex reward functions.

problem Optimizing arm selection with noisy human preference feedback for complex, non-linear reward functions.
method Neural network to estimate reward function using preference feedback, upper confidence bound and Thompson sampling algorithms.
result Sub-linear regret guarantees for efficient arm selection in contextual dueling bandits.

In this work, we have presented a simple analytical approximation scheme for generic non-linear FBSDEs. By treating the interested system as the linear decoupled FBSDE perturbed with non-linear generator and feedback terms, we have shown that it is possible to carry out a recursive approximation to an arbitrarily highe…

2011-06-01abs ↗pdf ↗

Proposes deep optimal feedback control for continuous-time systems with action constraints.

problem Learning optimal feedback control laws for robotic applications.
method Exploits Hamilton-Jacobi-Bellman equation and deep differential networks to learn optimal value function and feedback policy.
result Enables learning an optimal feedback control law that generates an optimal trajectory from any point in state-space without replanning.

NCAE tackles collaborative filtering for both explicit and implicit feedback.

problem Existing models struggle with both explicit and implicit feedback, overfitting, and lack of deep learning potential.
method NCAE uses a neural collaborative autoencoder with a three-stage pre-training mechanism and error reweighting.
result NCAE significantly outperforms state-of-the-art models on real-world datasets.

The paper analyzes portfolio selection with non-linear wealth dynamics and random coefficients.

problem Mean-variance portfolio selection with non-linear wealth dynamics and random coefficients.
method Solves an auxiliary stochastic control problem to construct a candidate portfolio, verifies optimality using convex duality, and provides the efficient frontier.
result Obtains the efficient frontier in closed form, showing people prefer riskless assets over classical linear markets.

Study non-linear combinatorial bandits with polynomial rewards, finding significant differences from linear cases.

problem Adversarial combinatorial bandits with general non-linear reward functions.
method Extending existing work on adversarial linear combinatorial bandits, analyzing minimax optimal regret for polynomial and non-polynomial reward functions.
result Minimax optimal regret bounds for adversarial combinatorial bandits with general non-linear reward functions.

A new algorithm for conversational recommendation systems using dueling bandits in GLMs.

problem Limited user feedback in existing conversational bandit methods.
method Integrates dueling bandits with relative feedback in generalized linear models.
result Theoretical and empirical validation of ConDuel's efficacy.

Model explains asset price dynamics, defaults, and market crashes via non-linear dynamics.

problem Understanding asset price dynamics, defaults, and market crashes in financial markets.
method Proposes a non-equilibrium model incorporating market frictions and feedback mechanisms.
result The QED model produces non-linear dynamics, broken scale invariance, and corporate defaults.

Causal inference uses observations to infer the causal structure of the data generating system. We study a class of functional models that we call Time Series Models with Independent Noise (TiMINo). These models require independent residual time series, whereas traditional methods like Granger causality exploit the var…

2012-07-21abs ↗pdf ↗

This work refines imitation learning to approximate optimal state-feedback policies for a quadcopter model.

problem Designing optimal control policies for complex systems like quadcopters.
method Supervised imitation learning using deep neural networks trained on optimal trajectories.
result Deep neural networks can approximate optimal state-feedback policies with high accuracy, even with two layers.

Improved regret bound for multinomial logistic bandits with non-linearity.

problem Maximizing rewards in multinomial logistic bandits with non-linear feedback.
method Extended the definition of κκ_* to multinomial setting and proposed an efficient algorithm.
result Minimax-optimal regret bound of O~(RdKT/κ) \smash{\widetilde{\mathcal{O}}( R d \sqrt{ {KT}/{κ_*}} ) } , improving over existing guarantees.

New algorithm uses random matrices for neural network training without synaptic weight symmetries.

problem Training neural networks efficiently and without synaptic weight symmetries.
method Contrastive Hebbian learning with random feedback weights.
result Random contrastive Hebbian learning achieves better computational models for learning.

VAEs improve collaborative filtering for implicit feedback.

problem Limited modeling capacity of linear factor models in collaborative filtering.
method Introduced a generative model with multinomial likelihood and used Bayesian inference for parameter estimation.
result Significantly outperforms state-of-the-art baselines on real-world datasets.

Model predicts insolvency risks in banks due to liquidity and credit risks.

problem Determining insolvency regions in banks due to non-linear interaction between liquidity and credit risks.
method Developed a continuous-time structural dynamic model integrating Basel III requirements into a stochastic optimal control framework. Used Hamilton-Jacobi-Bellman (HJB) equation to solve for insolvency boundary. Derived surrogate analytical approximation for real-time monitoring.
result Calibrated model reveals significant non-linear threshold effects and accelerates insolvency transition.

Oracle-efficient algorithms reduce combinatorial semi-bandit regret to logarithmic time.

problem Scalability issue in combinatorial semi-bandit problems due to high combinatorial optimization costs.
method Oracle-efficient frameworks that minimize oracle queries while maintaining tight regret guarantees.
result Achieved ildeO(T) ilde{O}(\sqrt{T}) regret with O(loglogT)O(\log\log T) oracle queries for worst-case linear rewards.

New insights into cascade feedback linearization of control systems.

problem Obtaining a cascade feedback linearization for invariant control systems.
method Introducing truncated versions of operators from the calculus of variations to prove new theorems.
result Established new geometry and foundational theorems for future work.

Paper proposes a combined model for better recommendation by integrating explicit and implicit feedbacks.

problem Improve recommendation accuracy by considering both explicit and implicit feedbacks.
method Developed three models (RHC-PMF, RV-PMF, RHCV-PMF) that incorporate users' explicit and implicit feedbacks for better rating prediction.
result RHCV-PMF model outperforms other models in cold start scenarios for both users and items.

MOCA uses modular attention to estimate causal effects from complex data.

problem Estimating causal effects from observational data with complex, non-linear, and high-dimensional treatment and outcome mechanisms.
method MOCA is a transformer-based framework that separates treatment and outcome modeling through modular design and one-way attention mechanism, with cutting-feedback to prevent outcome influence on treatment representations.
result MOCA outperforms classical estimators and machine learning approaches across various simulated and real-world scenarios.

New method learns from either positive or negative feedback alone.

problem Limited applicability of existing preference optimization methods in scenarios with only unpaired feedback.
method Decouples learning from positive and negative feedback, using expectation-maximization (EM) to optimize probability of positive outcomes and explicitly incorporate negative examples.
result Stable learning from negative feedback alone demonstrated.

Study on RL from human bandit feedback for sequence-to-sequence learning, showing reliability and learnability.

problem Reliability and learnability of human bandit feedback for RL from sequence-to-sequence learning.
method Investigated reliability of human bandit feedback, analyzed influence on reward estimator learnability, and tested improvements with regression-based reward estimator.
result Improvements of over 1 BLEU can be achieved by integrating a regression-based reward estimator trained on cardinal feedback into RL for NMT.

User preferences for items can be inferred from either explicit feedback, such as item ratings, or implicit feedback, such as rental histories. Research in collaborative filtering has concentrated on explicit feedback, resulting in the development of accurate and scalable models. However, since explicit feedback is oft…

2011-09-27abs ↗pdf ↗

New algorithms for best arm identification in delayed feedback MABs.

problem Best arm identification in multi-armed bandits with delayed feedback.
method Generalized framework for modeling partial and delayed feedback, efficient algorithms for biased and unbiased estimators, and parallel MAB extensions.
result Exploiting partial feedback can lead to significant improvements over baselines in sequential and parallel MAB settings.

This paper improves image retrieval accuracy through novel relevance feedback methods.

problem Improving image retrieval accuracy in Content-Based Image Retrieval (CBIR).
method Novel addition to feature re-weighting and classification techniques, focusing on 0-th iteration improvement.
result Significantly improved retrieval accuracy from relevance 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.

Classifier learns to ignore unreliable feedback from end users.

problem Improving classifier performance by filtering unreliable feedback.
method Modeling end users as autonomous agents, periodically retraining classifier with filtered feedback.
result Classifier can identify and filter out unreliable feedback, improving performance.

Advocates a local feedback approach for RL in unknown systems.

problem Finding optimal feedback laws in unknown nonlinear dynamical systems.
method Searches over a local feedback representation consisting of an open-loop sequence and an optimal linear feedback law.
result Results in highly efficient training and superior performance compared to global methods.

A method corrects feedback shift in predicting conversion rates with delayed feedback.

problem Delayed feedback leads to mislabeling of positive instances in training data.
method Uses importance weight approach to correct feedback shift.
result Proposed method outperforms existing methods in offline and online experiments.