Thompson Sampling bounds for contextual bandits with sub-Gaussian rewards.
problem Improving the performance of Thompson Sampling in contextual bandits with sub-Gaussian rewards.
method Proved comprehensive bounds on Thompson Sampling expected cumulative regret based on mutual information and lifted information ratio for sub-Gaussian rewards.
result Explicit regret bounds for various contextual bandit scenarios.
Develops locally private methods for nonparametric contextual bandits.
problem Privacy concerns in sequential decision-making on sensitive data.
method Uniform-confidence-bound-type estimator and jump-start scheme.
result Minimax optimality of proposed methods supported by lower bounds.
Method selects best estimator for off-policy evaluation.
problem Choosing the best estimator for off-policy evaluation.
method Generic data-driven method for estimator selection.
result Method is competitive with oracle estimator, up to a constant factor.
Improved financial sentiment analysis using simple instruction tuning of LLMs.
problem Lack of accurate financial sentiment analysis by large language models.
method Instruction tuning of general-purpose LLMs with a small portion of financial sentiment data.
result Significant improvement in financial sentiment analysis, especially in complex scenarios.
This paper explores the complexity of learning representations in contextual linear bandits.
problem Understanding the complexity of representation learning in contextual linear bandits.
method Systematic approach to representation learning in contextual linear bandits, focusing on instance-dependent perspective.
result Representation learning is fundamentally more complex than linear bandits, with some cases being arbitrarily harder.
Paper develops a fair pricing algorithm for dynamic settings with uncertain demand.
problem Fair pricing in dynamic, uncertain demand scenarios.
method Contextual bandit algorithm with dynamic pricing and demand learning.
result Achieves optimal regret bound with fairness constraints.
Paper analyzes sample complexity for offline f f f -divergence-regularized contextual bandits.
problem Lack of tight analyses for sample complexity in offline reinforcement learning.
method Novel pessimism-based analysis for reverse KL divergence, establishing i l d e O ( ε − 1 ) ilde{O}(ε^{-1}) i l d e O ( ε − 1 ) sample complexity. result Achieves i l d e O ( ε − 1 ) ilde{O}(ε^{-1}) i l d e O ( ε − 1 ) sample complexity for reverse KL divergence, surpassing existing bounds. New algorithm tackles non-linear utility in MNL bandits with i l d e O ( T ) ilde{O}(\sqrt{T}) i l d e O ( T ) regret.
problem Sequential assortment selection with intricate user-item interactions.
method Upper Confidence Bound principle for non-linear parametric utility functions, including neural networks.
result Achieves i l d e O ( T ) ilde{O}(\sqrt{T}) i l d e O ( T ) regret bound for neural network-based utilities. The paper tackles risk-averse multi-armed bandit with linear payoffs.
problem Risk-averse contextual multi-armed bandit problem with linear payoffs.
method Apply Thompson Sampling algorithm for disjoint model and provide comprehensive regret analysis.
result Proved an O ( ( 1 + ρ + 1 ρ ) d ln T ln K δ d K T 1 + 2 ε ln K δ 1 ε ) O((1+ρ+\frac{1}ρ) d\ln T \ln \frac{K}δ\sqrt{d K T^{1+2ε} \ln \frac{K}δ \frac{1}ε}) O (( 1 + ρ + ρ 1 ) d ln T ln δ K d K T 1 + 2 ε ln δ K ε 1 ) regret bound for mean-variance criterion. ContextWIN uses neural networks and reinforcement learning to optimize decisions in dynamic environments.
problem Optimizing decisions in dynamic, context-aware environments like recommendation systems.
method Integrates a mixture of experts within a reinforcement learning framework to compute context-specific weights for decision-making.
result Enhanced efficiency and accuracy in Whittle index computation for each arm in RMABs.
New algorithms tackle latent bandit problems with lower regret.
problem Learning optimal actions in a latent state setting.
method General algorithms based on UCBs and Thompson sampling, aware of model uncertainty.
result Our methods have lower regret than classic bandit policies when latent states are fewer than actions.
AdaPrivate-TS: A differentially private Thompson Sampling algorithm for contextual bandits
problem Private Thompson Sampling for Contextual Bandits
method Combining Thompson Sampling with batched zCDP composition
result Achieves 93-99% of non-private performance at ε ∈ [0.5, 5] with logarithmic privacy cost
New methods for anytime-valid off-policy inference in contextual bandits.
problem Estimating properties of hypothetical policies in adaptive experiments.
method Modern martingale techniques for comprehensive OPE inference.
result Valid anytime inference for off-policy mean reward values and entire reward distributions.
Generative model predicts NFT collection transactions based on early history.
problem Predict future transactions of newly minted NFT collections.
method Unsupervised learning to extract contexts, then generate future transactions.
result Projected market value of new NFT collections.
Sharp analysis improves RLHF sample complexity with KL-regularization.
problem Improving RLHF sample complexity with KL-regularization.
method Sharp analysis of KL-regularized contextual bandits and RLHF.
result Achieved an O(1/ε) sample complexity when ε is sufficiently small.
The problem of building a coherent and non-monotonous conversational agent with proper discourse and coverage is still an area of open research. Current architectures only take care of semantic and contextual information for a given query and fail to completely account for syntactic and external knowledge which are cru…
A model integrates CNN and LSTM with LLM for better stock forecasting.
problem Complex stock market prediction with volatile patterns and multifaceted data.
method Two-Level Conv-LSTM Neural Network with LLM for holistic stock advising.
result Improved prediction accuracy and contextual insights.
Contextualized ML learns context-dependent effects using deep learning.
problem Learning heterogeneous and context-dependent effects in data.
method Applying deep learning to the meta-relationship between contextual information and context-specific parametric models.
result Unified framework for cluster analysis and cohort modeling.
IDS improves reinforcement learning with contextual information.
problem Optimizing IDS for contextual reinforcement learning.
method Investigated contextual bandit problems and proposed a computationally-efficient IDS.
result Contextual IDS outperforms conditional IDS by considering future contexts.
SADCBO optimizes contextual variables by balancing relevance and cost.
problem Optimizing contextual variables with varying costs and unknown relevance.
method Adaptive selection of relevant contextual variables using sensitivity analysis and early stopping.
result Consistent improvement in optimization across various examples.
GPT-4 improves stock price prediction from microblogging sentiments.
problem Improving stock price prediction using sentiment analysis of microblogs.
method Developed a novel method for contextual sentiment analysis using GPT-4, fine-tuning prompts for better accuracy.
result GPT-4 outperformed BERT in predicting stock price movements, achieving a peak accuracy of 71.47%.
The bundle approach and n-contextuality reveal quantum model contextuality.
problem Understanding contextuality in quantum models using topology.
method Using the bundle approach, we describe contextuality as the non-existence of global sections in the measure bundle. We introduce n-contextuality to explore model dependence on scenario topology.
result Quantum theory and GHZ models exhibit all levels of n-contextuality, showing contextuality is related to holonomy group non-triviality.
Proposes a neural network for contextual regression.
problem Improving model efficiency and interpretability in regression with contextual features.
method Simple contextual neural network (SCtxtNN) that separates context identification from context-specific regression.
result SCtxtNN achieves lower excess mean squared error and more stable performance than feed-forward neural networks.
Paper tackles domain adaptation for contextual bandits with sub-linear regret.
problem Adapting contextual bandit algorithms across domains with distribution shift.
method Learn a bandit model for the target domain using feedback from the source domain.
result Sub-linear regret bound maintained across domains.
Novel framework explains machine learning models using ontology-based sampling.
problem Generating precise and insightful explanations for machine learning models.
method Ontology-based sampling technique and learnable anchor algorithm.
result Our approach generates more precise and insightful explanations.
Transformers model contextual relations using probabilistic measures, revealing their expressive power.
problem Lack of clear understanding of Transformer's ability to model contextual relations.
method Introduced a measure-theoretic framework connecting softmax attention and entropy-regularized optimal transport.
result Transformer architectures can approximate arbitrary contextual relations, and the choice of normalization affects how these relations are represented.
Paper solves stochastic contextual linear bandits using linear bandit algorithms.
problem Stochastic contextual linear bandits with unknown context distribution.
method Establishes a reduction framework to convert to linear bandit problems.
result Achieves nearly optimal regret bound of O ( d T log T ) O(d\sqrt{T\log T}) O ( d T log T ) . In recent years, multi-armed bandit (MAB) framework has attracted a lot of attention in various applications, from recommender systems and information retrieval to healthcare and finance, due to its stellar performance combined with certain attractive properties, such as learning from less feedback. The multi-armed ban…
The study explores whether model selection guarantees apply to contextual bandits.
problem Applying model selection guarantees to contextual bandits.
method Investigates whether similar guarantees for model selection in statistical learning can be extended to contextual bandit learning.
result Initial findings suggest that model selection guarantees may not directly apply to contextual bandits.
Faster algorithm reduces contextual bandit regret with fewer offline regression calls.
problem Optimizing reward in contextual bandits with unknown functions.
method Designing a simple algorithm with O ( log T ) {O}(\log T) O ( log T ) offline regression calls. result Achieves statistically optimal regret with minimal offline calls.
Efficiently handles contextual bandits with diffusion models.
problem Challenges in online decision-making with contextual bandits.
method Leverage pre-trained diffusion models as priors to capture action dependencies.
result Developed an algorithm for efficient posterior approximation.
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.
CADR estimator improves inference for contextual bandit data.
problem Valid inference on contextual bandit data.
method CADR estimator for policy value, addressing adaptive data collection challenges.
result CADR provides correct coverage of confidence intervals.
LR-Robot automates SLRs with AI, expert oversight, and multidimensional analysis.
problem Efficient but contextually limited outputs from existing SLR frameworks.
method Human-in-the-loop process, structured knowledge sources, retrieval-augmented generation.
result Empirical demonstration of AI-driven literature synthesis in option pricing.
Paper tackles robust policy learning with incomplete data.
problem Learning policies from past data assumes future environment is the same, which is often false.
method Develops a distributionally robust policy evaluation and learning algorithm.
result Proposed algorithm provides robustness to adversarial perturbations and covariate shifts.
New algorithm learns optimal exploration parameters for contextual bandits.
problem Learning optimal exploration in contextual bandits.
method Proposes two algorithms that learn optimal exploration parameters online based on context and reward.
result Demonstrates improved performance in learning optimal exploration compared to traditional methods.
Survey of LLMs in finance tasks, highlighting progress and challenges.
problem Transforming financial practices with advanced LLMs.
method Exploration of various financial tasks, categorization, and analysis of methodologies.
result Unlocking novel opportunities for financial applications with LLMs.
BSG learns dynamic network spillovers and uncertainty quantification.
problem Identifying indirect spillovers and systemic risk in dynamic networks.
method Bayesian Spillover Graphs using FEVD and Bayesian time series models.
result Significant performance gains over baselines in identifying source and sink nodes.
The paper tackles learning varying DAG structures based on contextual features.
problem Learning a single DAG for the entire population from observational data.
method A neural network that maps contextual features to a weighted adjacency matrix of a DAG, with a projection layer to ensure acyclicity.
result The new approach can recover context-specific DAGs where existing methods fail.
A method for unsupervised contextual anomaly detection is proposed using a cross-linked pair of Variational Auto-Encoders for assigning a normality score to an observation. The method enables a distinct separation of contextual from behavioral attributes and is robust to the presence of anomalous or novel contextual at…
A framework for auto-tuning hyper-parameters in contextual bandit algorithms.
problem Auto-tuning hyper-parameters in real-time for contextual bandit algorithms.
method Proposes a Syndicated Bandits framework to learn multiple hyper-parameters dynamically.
result Achieves optimal regret bounds under certain scenarios and handles multiple contextual bandit algorithms.
New algorithm improves learning efficiency in multi-task contextual bandits.
problem Improving learning efficiency in multi-task contextual bandits.
method Alternating projected gradient descent (GD) and minimization estimator for low-rank feature matrix recovery.
result Proved regret bound for multi-task learning algorithm.
We consider the stochastic linear (multi-armed) contextual bandit problem with the possibility of hidden simple multi-armed bandit structure in which the rewards are independent of the contextual information. Algorithms that are designed solely for one of the regimes are known to be sub-optimal for the alternate regime…
New algorithm for contextual dueling bandits achieves nearly optimal regret.
problem Contextual dueling bandits with feedback on preferred options.
method Proposes FGTS.CDB, a Thompson sampling algorithm for linear contextual dueling bandits.
result Achieves nearly minimax-optimal regret of i l d e O ( d T ) ilde{\mathcal{O}}(d\sqrt T) i l d e O ( d T ) . New algorithm reduces contextual bandits to efficient regression.
problem Developing efficient algorithms for contextual bandits with general function classes.
method Reduction from contextual bandits to online regression with oracle.
result First universal and optimal reduction with no overhead.
New method for contextual bandit with missing rewards.
problem Contextual bandit with missing rewards in online settings.
method Combining contextual bandit approach with unsupervised learning (clustering) to estimate missing rewards.
result Promising empirical results on real-life datasets.
GLCB uses Gated Linear Networks for online contextual bandits.
problem Online learning in contextual bandits with uncertainty estimation.
method Gated Linear Networks (GLNs) for prediction and uncertainty estimation.
result GLCB outperforms state-of-the-art methods in online contextual bandits.
The paper tackles minimax optimality in continuum contextual bandits with Hölder continuity.
problem Minimizing regret in a continuum of contexts with Hölder continuity.
method Proves a static-to-contextual regret conversion theorem and analyzes various dependency cases.
result Achieves minimax optimal contextual regret for convex and strongly convex bandits.