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

Trend · papers per month

23477093 · Jun 202019922001200920172026
48 results for multi-task bandits

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.

Contextual bandits are a form of multi-armed bandit in which the agent has access to predictive side information (known as the context) for each arm at each time step, and have been used to model personalized news recommendation, ad placement, and other applications. In this work, we propose a multi-task learning frame…

2017-05-24abs ↗pdf ↗

Study multi-task learning with low-rank representation in stochastic linear bandits.

problem Transfer learning across multiple linear bandit tasks with shared low-dimensional representation.
method Proposes a greedy policy with trace norm regularization to implicitly learn a low-rank representation without knowing the rank.
result Upper bound on multi-task regret of NdT(T+d)r\sqrt{NdT(T+d)r}, showing benefit over independent task solving.

New algorithms minimize regret in multi-task and lifelong linear bandits with shared representation.

problem Minimizing regret in multi-task and lifelong linear bandits with shared representation.
method Novel algorithms using efficient estimator for low-rank linear feature extractor and novel analysis.
result Achieved regret bounds matching minimax lower bound up to logarithmic factors.

New algorithms improve multi-task bandit performance by transferring reward samples.

problem Sequential multi-task bandit problems with adjacent similar tasks.
method Two UCB-based algorithms that transfer reward samples between tasks.
result Transfer of reward samples reduces overall regret compared to no transfer.

New algorithm reduces sample complexity for multi-task bandits.

problem Optimizing representation and predictor pairs for multi-task bandits.
method OSRL-SC algorithm with sample complexity H(Glog(1/δG)+Xlog(1/δH))H(G\log(1/δ_G)+ X\log(1/δ_H)).
result OSRL-SC algorithm approaches sample complexity lower bounds.

The paper tackles budget allocation for multiple campaigns using a novel combinatorial bandit approach.

problem Maximizing cumulative returns with limited budgets across various ad lines.
method Formulated as a multi-task combinatorial bandit problem, integrates Bayesian hierarchical models, and uses Thompson sampling.
result Demonstrates robustness and adaptability in maximizing overall cumulative returns.

The paper tackles decision making problems with funnel structure in email marketing campaigns.

problem Decision making challenges in systems with funnel structure, where fewer observations are received from deeper layers.
method Formulated as a contextual bandit with funnel structure and developed a multi-task learning algorithm.
result Our algorithms offer significant improvement over previous methods in email marketing campaigns.

We discuss multi-task online learning when a decision maker has to deal simultaneously with M tasks. The tasks are related, which is modeled by imposing that the M-tuple of actions taken by the decision maker needs to satisfy certain constraints. We give natural examples of such restrictions and then discuss a general …

2009-02-20abs ↗pdf ↗

MixTS uses a mixture prior to analyze Thompson Sampling in multi-task learning.

problem Analyzing Thompson Sampling in environments with uncertain and multi-class problems.
method Developed MixTS by incorporating a mixture prior into Thompson Sampling and using a novel proof technique for mixture distributions.
result Proved Bayes regret bounds for MixTS in linear bandits and finite-horizon reinforcement learning.

Algorithm finds latent structure in value functions for improved reinforcement learning.

problem Finding latent structure in value functions for efficient reinforcement learning.
method Proposes a practical algorithm using two posterior distributions over state abstractions and abstract-state values.
result Substantial performance gains in multi-task settings where tasks share a common, low-dimensional representation.

Robust Policy Search is the problem of learning policies that do not degrade in performance when subject to unseen environment model parameters. It is particularly relevant for transferring policies learned in a simulation environment to the real world. Several existing approaches involve sampling large batches of traj…

2019-01-01abs ↗pdf ↗

Multi-task learning uses auxiliary data or knowledge from relevant tasks to facilitate the learning in a new task. Multi-task optimization applies multi-task learning to optimization to study how to effectively and efficiently tackle multiple optimization problems simultaneously. Evolutionary multi-tasking, or multi-fa…

2018-12-15abs ↗pdf ↗

The paper uses random matrix theory for multi-task regression, improving time series forecasting.

problem Improving time series forecasting using multi-task regression.
method Applying random matrix theory to multi-task regression problems, deriving closed-form solutions for optimization.
result Provides a robust foundation for hyperparameter optimization in multi-task regression scenarios.

We study the stability properties of nonlinear multi-task regression in reproducing Hilbert spaces with operator-valued kernels. Such kernels, a.k.a. multi-task kernels, are appropriate for learning prob- lems with nonscalar outputs like multi-task learning and structured out- put prediction. We show that multi-task ke…

2013-06-17abs ↗pdf ↗

Reliable and effective multi-task learning is a prerequisite for the development of robotic agents that can quickly learn to accomplish related, everyday tasks. However, in the reinforcement learning domain, multi-task learning has not exhibited the same level of success as in other domains, such as computer vision. In…

2018-02-03abs ↗pdf ↗

Multi-task learning holds the promise of less data, parameters, and time than training of separate models. We propose a method to automatically search over multi-task architectures while taking resource constraints into consideration. We propose a search space that compactly represents different parameter sharing strat…

2019-08-12abs ↗pdf ↗

Multi-task learning (MTL) has achieved success over a wide range of problems, where the goal is to improve the performance of a primary task using a set of relevant auxiliary tasks. However, when the usefulness of the auxiliary tasks w.r.t. the primary task is not known a priori, the success of MTL models depends on th…

2019-04-08abs ↗pdf ↗

While deep learning and deep reinforcement learning (RL) systems have demonstrated impressive results in domains such as image classification, game playing, and robotic control, data efficiency remains a major challenge. Multi-task learning has emerged as a promising approach for sharing structure across multiple tasks…

2020-01-19abs ↗pdf ↗

Near-optimal rates for multi-task learning with shared representations.

problem Approximation and statistical complexity of learning multiple operators.
method Multiple Neural Operators (MNO) architecture and comparison with DeepONet.
result Near-optimal upper and lower bounds for approximation and generalization.

SON-GOKU uses graph coloring to improve multi-task learning by partitioning tasks into compatible groups.

problem Gradient interference between conflicting multi-task learning objectives slows convergence and model performance.
method SON-GOKU computes gradient interference, constructs an interference graph, and applies greedy graph-coloring to partition tasks.
result SON-GOKU consistently outperforms baselines and state-of-the-art multi-task optimizers on six datasets.

Wide neural networks can benefit from multi-task learning in their infinite-width limit.

problem The generalization behavior of wide neural networks in multi-task learning settings.
method Optimizing wide ReLU neural networks with L2-regularization promotes multi-task learning in the infinite-width limit.
result An exact quantitative characterization of multi-task learning in the infinite-width limit of wide ReLU neural networks.

Deep multi-task learning benefits from low intrinsic dimensionality, leading to better generalization.

problem Improving generalization in deep multi-task learning with high-dimensional models.
method Parametrizing multi-task networks in a low-dimensional space using random expansions and weight compression.
result First non-vacuous generalization bounds for deep multi-task networks are derived.

Paper estimates noise covariance in correlated multi-task linear models.

problem Estimating noise covariance in multi-task high-dimensional linear models with correlated noise.
method Uses multi-task elastic-net and lasso estimators to estimate noise covariance, correcting bias in squared residual matrix.
result Develops a novel estimator of noise covariance that converges at rate n1/2n^{-1/2}, matching oracle estimator under suitable conditions.

Develops a scalable multi-task Gaussian process with neural embedding for improved performance.

problem High model complexity and limited model capability in multi-task Gaussian processes.
method Neural embedding of coregionalization, advanced variational inference, sparse approximation.
result Higher prediction quality and better generalization of the NSVLMC model.

Bayesian approach improves network lasso for multi-task learning.

problem Improving the determination of relational coefficients in network lasso.
method Proposes a Bayesian approach to solve multi-task learning problems using network lasso.
result Objective determination of relational coefficients through Bayesian estimation.

Develops a method for fairness in multi-task learning using Wasserstein barycenters.

problem Extending fairness to multi-task learning with shared representations.
method Definition of Strong Demographic Parity extended to multi-task learning using multi-marginal Wasserstein barycenters. Closed form solution for optimal fair predictor.
result Empirical results show practical value of post-processing methodology in promoting fair decision-making.

Multi-task sparse feature learning aims to improve the generalization performance by exploiting the shared features among tasks. It has been successfully applied to many applications including computer vision and biomedical informatics. Most of the existing multi-task sparse feature learning algorithms are formulated a…

2012-10-22abs ↗pdf ↗

Improves shared encoder representations for better multi-task learning performance.

problem Improving quality of shared encoder representations in multi-task learning.
method Dummy Gradient norm Regularization (DGR) to decrease gradient norm of dummy task-specific predictors.
result DGR improves multi-task prediction performances and superior performance compared to existing methods.

Research explores the trade-off between multi-task learning and multitasking in deep neural networks.

problem Trade-off between multi-task learning and multitasking in deep neural networks.
method Meta-learning algorithm to manage the trade-off between shared and separated representations.
result Agent successfully optimizes training strategy based on environment.

This paper investigates multi-task reinforcement learning in non-Markovian decision making, showing benefits in sample efficiency.

problem Investigating multi-task reinforcement learning in non-Markovian decision making processes.
method Developed a joint model class for tasks and used the ηη-bracketing number to quantify complexity and similarity.
result Multi-task reinforcement learning can improve sample efficiency in non-Markovian decision making processes.

Flexible multi-task learning framework using summary statistics.

problem Data-sharing constraints in healthcare settings.
method Proposes a flexible multi-task learning framework utilizing summary statistics and adaptive parameter selection.
result Systematic non-asymptotic analysis and simulations demonstrate the method's performance.

Multi-task learning aims to learn multiple tasks jointly by exploiting their relatedness to improve the generalization performance for each task. Traditionally, to perform multi-task learning, one needs to centralize data from all the tasks to a single machine. However, in many real-world applications, data of differen…

2016-12-13abs ↗pdf ↗

Paper extends multi-task Gaussian Cox processes for heterogeneous tasks.

problem Modeling multiple heterogeneous correlated tasks jointly.
method Data augmentation and mean-field approximation for non-conjugate Bayesian inference.
result Demonstrates improved performance and inference on synthetic and real data.

Boosts share routing for multi-task learning with flexible sparse connections.

problem Designing suitable sharing mechanisms among multiple tasks in multi-task learning.
method Proposes MTNAS framework to modularize sharing into sub-networks with sparse connections and gating.
result Demonstrates consistent improvement over single-task and typical multi-task methods while maintaining efficiency.