New algorithm reduces regret with diverse contexts in bandits.
problem Impact of context diversity on stochastic linear contextual bandits.
method Design of LinUCB-d algorithm and analysis of its regret performance.
result Cumulative expected regret is bounded by a constant under diverse context assumption.
The study provides precise asymptotic theory for in-context learning by Transformers.
problem Understanding the sample complexity, pretraining task diversity, and context length for successful in-context learning.
method An exactly solvable model of linear regression task by linear attention, deriving sharp asymptotics.
result Double-descent learning curve with increasing pretraining examples, phase transition between low and high task diversity regimes.
When constructing a classifier ensemble, diversity among the base classifiers is one of the important characteristics. Several studies have been made in the context of standard static data, in particular, when analyzing the relationship between a high ensemble predictive performance and the diversity of its components.…
We tackle the task of diverse 3D human motion prediction, that is, forecasting multiple plausible future 3D poses given a sequence of observed 3D poses. In this context, a popular approach consists of using a Conditional Variational Autoencoder (CVAE). However, existing approaches that do so either fail to capture the …
We study the problem of generating interesting endings for stories. Neural generative models have shown promising results for various text generation problems. Sequence to Sequence (Seq2Seq) models are typically trained to generate a single output sequence for a given input sequence. However, in the context of a story,…
Looped Transformers improve robustness and expressivity in in-context learning for diverse tasks.
problem Improving robustness and expressivity in in-context learning for diverse tasks.
method Study in-context linear regression with diverse tasks, focusing on depth and looping.
result Looped Transformers exhibit similar expressive power and are provably robust under mild assumptions.
Training task diversity improves ICL with linear attention.
problem Understanding the impact of training task diversity on in-context learning.
method Modeling training task vectors as a mixture of low-rank Gaussians.
result Our model explains why training with task diversity shortens the ICL plateau and achieves out-of-distribution generalization.
Transformers learn to generalize out-of-distribution with diverse pretraining tasks.
problem Conditions for pretrained transformers to generalize out-of-distribution.
method Empirical study of task diversity and pretraining distribution.
result As task diversity increases, transformers transition from specialized to generalized solutions.
Study on neural scaling laws for solving linear systems in-context.
problem Theoretical guarantees for solving linear systems using a linear transformer architecture.
method Neural scaling laws and task diversity for in-domain and out-of-domain generalization.
result Novel notion of task diversity for necessary and sufficient condition of generalization under task shifts.
This paper formulates the problem of building a context-aware predictive model based on user diverse behavioral activities with smartphones. In the area of machine learning and data science, a tree-like model as that of decision tree is considered as one of the most popular classification techniques, which can be used …
Attention mechanisms have become ubiquitous in NLP. Recent architectures, notably the Transformer, learn powerful context-aware word representations through layered, multi-headed attention. The multiple heads learn diverse types of word relationships. However, with standard softmax attention, all attention heads are de…
Ensemble learning is a methodology that integrates multiple DNN learners for improving prediction performance of individual learners. Diversity is greater when the errors of the ensemble prediction is more uniformly distributed. Greater diversity is highly correlated with the increase in ensemble accuracy. Another attr…
Paper tackles diversity in Airbnb search results.
problem Show diverse results to improve user experience.
method Heuristic based approaches → Deep learning solution using RNNs.
result Novel deep learning solution improves diversity in search results.
A financial market is called "diverse" if no single stock is ever allowed to dominate the entire market in terms of relative capitalization. In the context of the standard Ito-process model initiated by Samuelson (1965) we formulate this property (and the allied, successively weaker notions of "weak diversity" and "asy…
Transformers learn to use induction heads or shortcuts based on data diversity.
problem How data diversity influences the behavior of transformers.
method Gradient-based training of a single-layer transformer on a minimal task.
result Data diversity steers transformers toward induction heads or shortcuts.
Transformers prefer simpler explanations in hierarchical tasks.
problem Navigating tasks with varying complexity levels.
method Well-controlled testbeds based on Markov chains and linear regression.
result Transformers favor the least complex sufficient explanation when presented with simpler data.
NERS improves RL by sampling diverse transitions considering local and global contexts.
problem Sampling biases in experience replay lead to redundant transitions.
method Neural Experience Replay Sampler (NERS) that considers both local and global contexts.
result NERS significantly improves RL performance by sampling diverse and meaningful transitions.
We propose a novel diverse feature selection method based on determinantal point processes (DPPs). Our model enables one to flexibly define diversity based on the covariance of features (similar to orthogonal matching pursuit) or alternatively based on side information. We introduce our approach in the context of Bayes…
DMNL bandits optimize assortment choices balancing relevance and diversity.
problem Balancing relevance-driven choice with within-assortment diversity.
method Augments MNL choice probabilities with a submodular diversity function, proposing a white-box UCB-based algorithm.
result Achieves at least a (1−e+11)-approximate regret bound of $ ilde{O}\left(d \sqrt{T/K}
ight)$. We consider the problem of diversity enhancing clustering, i.e, developing clustering methods which produce clusters that favour diversity with respect to a set of protected attributes such as race, sex, age, etc. In the context of fair clustering, diversity plays a major role when fairness is understood as demographic…
Post-hoc explanations of machine learning models are crucial for people to understand and act on algorithmic predictions. An intriguing class of explanations is through counterfactuals, hypothetical examples that show people how to obtain a different prediction. We posit that effective counterfactual explanations shoul…
einspace expands NAS search space to include diverse neural architectures.
problem NAS results are often limited to existing structures; new designs are rare.
method einspace uses a probabilistic context-free grammar to create a versatile search space.
result einspace discovers novel and improved architectures, including convolutions and attention.
Proposes MOGFNs for generating diverse Pareto optimal solutions in multi-objective optimization.
problem Generating diverse candidates in multi-objective optimization with conflicting objectives.
method Introduces MOGFNs based on GFlowNets, with two variants: MOGFN-PC and MOGFN-AL.
result Improved candidate diversity compared to existing methods.
KVCOMM optimizes multi-agent LLM systems by reusing KV-caches, reducing redundant processing.
problem Substantial overhead from reprocessing overlapping contexts across multi-agent systems.
method KVCOMM reuses KV-caches and adjusts offsets for shared content using a pool of cached examples (anchors).
result Achieves over 70% reuse rate across diverse multi-agent tasks, up to 7.8x speedup.
The paper clusters hypergraphs to find diverse and experienced groups based on past experiences.
problem Finding diverse and experienced groups with respect to past experiences.
method Regularized edge-based hypergraph clustering objective with a 2-approximation algorithm.
result Demonstrates an efficient 2-approximation algorithm for clustering hypergraphs.
LoRA-MCL improves language models by generating diverse sentence continuations.
problem Language models struggle with generating diverse, plausible sentence continuations.
method Low-Rank Adaptation combined with Multiple Choice Learning (MCL) to handle ambiguity.
result LoRA-MCL generates high-diversity and relevant outputs in various tasks.
Single model learns physics from diverse data.
problem Lack of universal physics models for diverse applications.
method General Physics Transformer (GPhyT) trained on diverse physics data.
result Single model achieves superior performance across multiple physics domains.
Paper studies how few pretraining tasks are needed for a linear model to solve new tasks.
problem How many pretraining tasks are needed for a linear model to solve new tasks?
method Pretrained a linear attention model for linear regression with a Gaussian prior.
result Effective pretraining requires a small number of independent tasks, and the model closely matches Bayes optimal.
A recommendation framework helps users choose healthcare interventions.
problem Choice overload in online healthcare communities.
method Multi-Armed Bandit (MAB) approach with innovative model components.
result Our recommendation design outperforms state-of-the-art systems.
Bayesian analysis reveals epistemic uncertainty as a key diagnostic for delayed generalization in in-context learning.
problem Delayed generalization in in-context learning from few examples.
method Bayesian perspective, modular arithmetic tasks, approximate Bayesian techniques, spectral mechanism analysis.
result Epistemic uncertainty collapses sharply when the model groks, indicating a practical diagnostic of generalization.
CAMul forecasts with calibrated and accurate multi-view time-series data.
problem Combining diverse data sources for reliable time-series forecasting.
method CAMul integrates multi-modal data views dynamically, assigning importance based on context.
result CAMul outperforms state-of-the-art models by 25% in accuracy and calibration.
The paper proves how Transformers learn from context and generalize well.
problem Understanding how Transformers generalize from diverse tasks.
method Developed a statistical theory for in-context learning, separating risk into Bayes Gap and Posterior Variance.
result The Posterior Variance is task-independent, and the Bayes Gap decreases with more in-context examples.
LoCo-RLHF models diverse human feedback with contextual information.
problem Heterogeneous human feedback from diverse contexts and preferences.
method Low-rank contextual preference model, PRS policy.
result LoCo-RLHF achieves tighter sub-optimality gap than existing methods.
A basic, and still largely unanswered, question in the context of Generative Adversarial Networks (GANs) is whether they are truly able to capture all the fundamental characteristics of the distributions they are trained on. In particular, evaluating the diversity of GAN distributions is challenging and existing method…
Transformers learn new tasks from few examples via optimal approximation.
problem Learning new tasks from limited examples using large language models.
method Developed approximation and generalization error bounds for transformers trained on nonparametric regression tasks.
result Transformers achieve minimax optimal estimation risk in context.
Smart devices of everyday use (such as smartphones and wearables) are increasingly integrated with sensors that provide immense amounts of information about a person's daily life such as behavior and context. The automatic and unobtrusive sensing of behavioral context can help develop solutions for assisted living, fit…
Consider a binary decision making process where a single machine learning classifier replaces a multitude of humans. We raise questions about the resulting loss of diversity in the decision making process. We study the potential benefits of using random classifier ensembles instead of a single classifier in the context…
A new framework uses directed information to efficiently select context chunks.
problem Efficiently selecting relevant context chunks for query understanding.
method Directed Information γ-covering framework, formulated as a γ-cover problem, with a greedy algorithm for context selection. result The γ-covering algorithm provides clear advantages in hard-decision regimes like context compression and single-slot prompt selection. Study optimal stopping for group with diverse discount rates using an attitude function.
problem Optimal stopping for a group with diverse discount rates under an aggregation preference.
method Develop iterative approach using consistent planning for time-consistent equilibria.
result Characterize all time-consistent mild equilibria as fixed points of an operator.
Study provides guarantees on neural network generalization for solving Schrödinger equations.
problem Probability of centralizer being trivial for random matrices.
method Lower bounds on probability using random matrix theory and machine learning theory.
result Guarantees on transformer-based neural networks' in-context learning ability.
CausalRegNet generates accurate data for gene perturbation experiments, improving CSL methods.
problem Assessing and selecting causal structure learning methods in gene perturbation experiments.
method CausalRegNet, a multiplicative effect structural causal model, generates accurate observational and interventional data.
result CausalRegNet generates more accurate distributions and scales better than current simulation frameworks.
Benchmark assesses forecasting models' ability to use textual context.
problem Forecasting models struggle with integrating textual context.
method Introduces a benchmark with numerical and textual data, evaluates various models.
result LLM prompting method outperforms other models.
New algorithm reduces bandit problem's regret bound to logarithmic in dimension.
problem Sparse linear bandit problem with sparse reward structure.
method Proposes an algorithm that uses compatibility condition on optimal arm.
result Achieves regret bound of O(poly log dT) without additional diversity assumptions.
AIPS improves ranking policy evaluation by adapting to diverse user behavior.
problem Inaccurate Off-Policy Evaluation of ranking policies due to high variance under diverse user behavior.
method Developed Adaptive IPS (AIPS) that adapts to different user behaviors and minimizes MSE.
result AIPS achieves minimum variance among unbiased estimators and provides significant empirical accuracy improvement.
A novel framework extracts essential factors from order flow data for high-frequency trading.
problem Challenges in extracting and utilizing order flow data due to its large volume and limitations of traditional techniques.
method Proposes a Context Encoder and Factor Extractor for unsupervised learning of important signals from order flow data.
result Extracts superior factors from order flow data, improving stock trend prediction and order execution tasks.
Paper explores privacy in machine learning models using ICL.
problem Privacy in in-context learning models.
method Differentially private pretraining algorithm for linear attention heads.
result Characterizes privacy-accuracy trade-off for ICL in linear regression.
GIFT-Eval benchmarks time series forecasting models across diverse datasets.
problem Lack of comprehensive benchmarks for evaluating time series foundation models.
method Developed GIFT-Eval, a benchmark with 23 datasets, 177 million data points, and 144,000 time series.
result Promotes evaluation of foundation models across various domains and frequencies.
New method accounts for hidden context in preference learning for RLHF models.
problem Incomplete data with hidden context affects RLHF model outcomes.
method Distributional Preference Learning (DPL) methods estimate hidden context distributions.
result DPL methods reduce RLHF vulnerabilities by accounting for hidden context.