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

Trend · papers per month

114227341454 · Jun 202019922001200920172026
48 results for contextual processing

This study analyzes how RNNs process context in sentiment analysis.

problem Understanding how recurrent neural networks process context in sentiment analysis.
method Developed methods to reverse engineer RNNs, identifying contextual effects and quantifying their strength and timescale.
result Identified inputs that induce contextual effects and quantified their properties.

Novel framework for contextual anomaly detection models uncertainty.

problem Identifying anomalies in target variables influenced by contextual variables.
method Normalcy score (NS) framework using heteroscedastic Gaussian process regression.
result NS outperforms state-of-the-art methods in detection accuracy and interpretability.

A new algorithm uses concavity in Gaussian processes to optimize decisions in bandit problems.

problem Optimizing decisions in sequential problems with context-dependent rewards.
method Proposes a UCB algorithm using a shape-constrained reward function estimator based on a Gaussian Process model with concavity constraints.
result Derives regret bounds for the proposed UCB algorithm.

This paper studies systematic exploration for reinforcement learning with rich observations and function approximation. We introduce a new model called contextual decision processes, that unifies and generalizes most prior settings. Our first contribution is a complexity measure, the Bellman rank, that we show enables …

2016-10-29abs ↗pdf ↗

New findings on universal learning in contextual bandits with adversarial rewards.

problem Learning in contextual bandits with time-varying, adversarial rewards.
method Characterization of learnable processes and necessary/sufficient conditions for universal learning.
result Optimistic universal learning for contextual bandits with adversarial rewards is impossible in general.

The article presents methods to select models from behavioral learning data, with applications to contextual bandits.

problem Model selection for behavioral learning data, especially in non-stationary environments.
method Two model selection methods: a general hold-out procedure and an AIC-type criterion, adapted for non-stationary dependent data.
result Theoretical error bounds for these methods are close to those of the standard i.i.d. case.

Regularization-induced exploration improves contextual bandit performance.

problem Complex reward models in real-world contextual bandits are hard to explore effectively.
method Regularization-induced exploration using stochasticity in cross-validation.
result Regularization-induced exploration leads to reliable exploration in large-scale business environments.

New algorithm reduces best-in-class regret in contextual bandits.

problem Compete with the best policy in a class without model restrictions.
method Proposes an algorithm that updates policies by minimizing a pessimistic objective, including a clipped inverse-propensity estimate and variance penalty.
result Achieves fast best-in-class regret rates, including polylogarithmic rates in the parametric case.

Contextualizing financial news improves stock price predictions.

problem Predicting stock prices from financial news requires understanding historical context.
method Proposed a method using a large language model for main articles and a small model for historical context.
result Historical context significantly improves model performance across methods and time horizons.

CB-RL solves complex decision-making problems with contextual information and exogenous events.

problem Optimal policy in strategic decision-making problems that depend on environmental configuration and exogenous events.
method Contextual Bilevel Reinforcement Learning (CB-RL) with a stochastic Hyper Policy Gradient Descent (HPGD) algorithm.
result Demonstrated convergence and performance of the HPGD algorithm for reward shaping and tax design.

The paper develops a reinforcement learning model to estimate ad impact considering delayed and cumulative effects.

problem Accurately estimating ad impact considering delayed and long-term effects, cumulative impacts, and customer heterogeneity.
method Modeling ad bidding as a Contextual Markov Decision Process (CMDP) with delayed Poisson rewards, proposing a two-stage maximum likelihood estimator and reinforcement learning algorithm.
result Achieves a near-optimal regret bound of O~(dH2T)\tilde{O}{(dH^2\sqrt{T})}, validating the approach through simulation experiments.

This paper assesses biases in contextualized word representations.

problem Analyzing biases in contextualized word representations.
method Proposes assessing bias at the contextual word level, capturing contextual effects of bias.
result Demonstrates evidence of bias in contextual word models, including racial bias and exacerbated effects for intersectional minorities.

Meta-learning reformulated as Bayesian risk minimization.

problem Learning models to quickly adapt to new tasks from small datasets.
method Formalized meta-learning as Bayesian risk minimization, using a probabilistic framework to compute predictive distributions from posterior distributions of latent variables conditioned on contextual datasets.
result A novel Gaussian approximation for the posterior distribution that converges to maximum likelihood estimates and outperforms Neural Process on benchmark datasets.

New algorithm matches best regret bound for tabular Contextual Bandit problems.

problem Learning from observations in uncertain environments.
method A minor variant of a reinforcement learning algorithm for MDPs.
result The algorithm matches the best possible regret bound ildeO(SAT) ilde O (\sqrt{SAT}) for tabular Contextual Bandit problems.

Unified framework for human-like decision making in various sequential tasks.

problem Real-life decision-making involves diverse strategies leading to similar outcomes.
method Two-stream reward processing mechanism for flexible and unified models.
result Framework unified MAB, CB, and RL with comparable performance.

Improved online Lasso reduces regret in sparse linear contextual bandits.

problem Sparse linear contextual bandit problem with inefficient sampling.
method Perturbed adversary approach to alleviate sampling inefficiency.
result Online Lasso achieves O(kTlogd)\mathcal{O}(\sqrt{kT\log d}) regret bound.

Blood glucose value prediction is an important task in diabetes management. While it is reported that glucose concentration is sensitive to social context such as mood, physical activity, stress, diet, alongside the influence of diabetes pathologies, we need more research on data and methodologies to incorporate and ev…

2019-08-24abs ↗pdf ↗

Algorithm minimizes regret in dueling bandits with contextualized utilities.

problem Minimizing regret in dueling bandits with context-dependent utilities.
method Proposes CoLSTIM algorithm based on perturbed utility estimates.
result Achieves regret of order ildeO(dT) ilde O(\sqrt{dT}).

Novel algorithm reduces feature inclusion in online decision-making.

problem Optimizing decision-making for personalized user experiences with fairness.
method Online Batched Sequential Inclusion (OBSI) algorithm for sequential feature inclusion.
result OBSI outperforms other algorithms in terms of regret, relevance of features, and compute.

New algorithm reduces regret in RL with adversarial corruption.

problem Adversarial corruption in reinforcement learning.
method Uncertainty-weighted least-squares regression and weighted uncertainty estimator.
result Achieves regret of ildeO(T+ζ) ilde{O}(\sqrt{T} + ζ) for contextual bandits.

Study minimax-optimal rates for offline decision-making with function approximation.

problem Statistical complexity of offline decision-making with function approximation.
method Near minimax-optimal rates for stochastic contextual bandits and Markov decision processes, using pseudo-dimension and behavior policy.
result Established performance limits and new characterization of behavior policy.

In this work, we describe practical lessons we have learned from successfully using contextual bandits (CBs) to improve key business metrics of the Microsoft Virtual Agent for customer support. While our current use cases focus on single step einforcement learning (RL) and mostly in the domain of natural language proce…

2019-05-06abs ↗pdf ↗

This paper improves context-aware recommender systems by selecting and incorporating relevant low-dimensional contextual information.

problem Generating accurate recommendations is not enough; contextual information can cause issues like battery drain and privacy.
method Developed a feature-selection algorithm based on genetic algorithms to reduce context dimensions while maintaining explainability.
result The approach improves accuracy and transparency in recommendations, outperforming state-of-the-art models.

We extend manifold capacity to nonlinear neural representations with contextual information.

problem Efficient processing of information through neural representations.
method Theoretical framework leveraging latent directions in input space related to contextual information.
result Derivation of an exact formula for context-dependent manifold capacity.

We consider the recently proposed reinforcement learning (RL) framework of Contextual Markov Decision Processes (CMDP), where the agent interacts with a (potentially adversarial) sequence of episodic tabular MDPs. In addition, a context vector determining the MDP parameters is available to the agent at the start of eac…

2019-03-14abs ↗pdf ↗

A new estimator learns sparse linear models with context-dependent coefficients.

problem Sparse linear models lack flexibility compared to deep neural networks for handling feature groups.
method Contextual lasso estimator using a deep neural network with lasso regularization.
result Learned models can be sparser than standard lasso without sacrificing predictive power.

We consider a planning problem where the dynamics and rewards of the environment depend on a hidden static parameter referred to as the context. The objective is to learn a strategy that maximizes the accumulated reward across all contexts. The new model, called Contextual Markov Decision Process (CMDP), can model a cu…

2015-02-08abs ↗pdf ↗

Method learns evolving policies in healthcare contexts.

problem Understanding non-stationary behavior in evolving decision-making processes.
method Inverse Contextual Bandits (ICB) approach for learning interpretable representations of non-stationary behavior.
result Demonstrated applicability and accuracy of ICB method in liver transplantation policies.