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

102205307409 · Jun 202019922001200920172026
48 results for Multi-output Linear Bandit

Optimal algorithms identify non-dominated arms in multi-output linear bandit models.

problem Identifying the Pareto Set in multi-output linear bandit models.
method Design-based algorithms for Pareto Set Identification (PSI) in a structured multi-output linear bandit model.
result Nearly optimal guarantees in both fixed-budget and fixed-confidence settings.

The paper develops exact and approximate conformal inference methods for multi-output regression.

problem Uncertainty quantification in multi-output regression predictions.
method Exact derivations and approximations of conformal inference p-values for linear multi-output predictors, and efficient methods for nonlinear predictors.
result Efficient methods for approximating conformal prediction regions for multi-output predictors, both linear and nonlinear.

Gaussian processes (GPs), or distributions over arbitrary functions in a continuous domain, can be generalized to the multi-output case: a linear model of coregionalization (LMC) is one approach. LMCs estimate and exploit correlations across the multiple outputs. While model estimation can be performed efficiently for …

2017-05-30abs ↗pdf ↗

MO-GP models fill gaps in biophysical data with across-domain info transfer.

problem Gap filling of biophysical parameters LAI and fAPAR over rice areas.
method Multi-output Gaussian Processes (MO-GP) based on Linear Model of Coregionalization (LMC).
result MO-GP models successfully predict biophysical variables even in high missing data regimes.

The paper introduces a non-linear version of the process convolution formalism for building covariance functions for multi-output Gaussian processes. The non-linearity is introduced via Volterra series, one series per each output. We provide closed-form expressions for the mean function and the covariance function of t…

2018-10-10abs ↗pdf ↗

We present a novel extension of multi-output Gaussian processes for handling heterogeneous outputs. We assume that each output has its own likelihood function and use a vector-valued Gaussian process prior to jointly model the parameters in all likelihoods as latent functions. Our multi-output Gaussian process uses a c…

2018-05-19abs ↗pdf ↗

Multi-output learning aims to simultaneously predict multiple outputs given an input. It is an important learning problem due to the pressing need for sophisticated decision making in real-world applications. Inspired by big data, the 4Vs characteristics of multi-output imposes a set of challenges to multi-output learn…

2019-01-02abs ↗pdf ↗

DeepICMGP surrogate models multiple outputs efficiently.

problem Challenges in modeling dependencies between multiple outputs using traditional multi-output GPs.
method Introduces hierarchical coregionalization structures across layers in DGPs.
result Demonstrates competitive performance and active learning strategies.

Safe active learning for multi-output Gaussian processes reduces data acquisition costs and ensures safety.

problem Expensive data acquisition and safety concerns in multi-output regression problems.
method Proposes a safe active learning approach considering data informativeness and safety constraints.
result Improved convergence compared to competitors on simulated and real-world datasets.

This study compares multivariate vs univariate machine learning for multi-output regression.

problem When to use multivariate ensemble techniques over separate univariate models.
method Comparative analysis of different multivariate approaches for multi-output regression.
result Multivariate ensemble techniques outperform separate univariate models in simulations.

Optimistic bounds for multi-output learning using self-bounding Lipschitz condition.

problem Learning vector-valued functions from supervised data.
method Introducing self-bounding Lipschitz condition and proving optimistic bounds using local Rademacher complexity and Srebro's inequality.
result Minimax optimal generalization bounds for multi-output learning, up to logarithmic factors.

Paper introduces conformal prediction for reliable uncertainty quantification in landmark localization.

problem Systematic underestimation of total predictive uncertainty in landmark localization.
method Conformal prediction framework for multi-output regression, generating flexible prediction regions.
result Methods outperform existing approaches in validity and efficiency across 2D and 3D datasets.

We construct flexible likelihoods for multi-output Gaussian process models that leverage neural networks as components. We make use of sparse variational inference methods to enable scalable approximate inference for the resulting class of models. An attractive feature of these models is that they can admit analytic pr…

2019-05-31abs ↗pdf ↗

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(dTlogT)O(d\sqrt{T\log T}).

A new algorithm balances global reward and group constraints in federated multi-armed bandits.

problem Maximizing global reward while protecting client privacy in federated learning.
method Combinatorial contextual bandit with group constraints, using a two-output Gaussian process.
result TCGP-UCB incurs low regret, balancing super arm reward and group reward constraints.

Unified study of nine multi-output conformal methods with generalized scores.

problem Challenges in extending conformal prediction to multi-output problems.
method Nine conformal methods with generalized multi-output conformity scores.
result Generalized scores ensure asymptotic conditional coverage and exact finite-sample marginal coverage.

Multi-output prediction deals with the prediction of several targets of possibly diverse types. One way to address this problem is the so called problem transformation method. This method is often used in multi-label learning, but can also be used for multi-output prediction due to its generality and simplicity. In thi…

2019-04-08abs ↗pdf ↗

Paper introduces vector-valued variation spaces for multi-output neural networks.

problem Understanding and optimizing multi-output neural networks.
method Development of vector-valued variation spaces and representer theorem.
result Novel bounds for layer widths in deep networks and a convex optimization method for compression.

Paper tackles LDP bandits learning with improved results and sub-linear regret.

problem Contextual bandits learning with LDP privacy constraints.
method Simple black-box reduction frameworks for context-free bandits, extended to GLB.
result First result for BCO with multi-point feedback under LDP, sub-linear regret for GLB.

First robust bandit algorithm for contextual bandits with sub-linear regret.

problem Vulnerability of linear contextual bandit algorithms to adversarial attacks.
method Proposes a robust bandit algorithm for stochastic linear contextual bandits under fully adaptive and omniscient attacks.
result Sub-linear regret under various attacks without requiring attack information.

This paper tackles federated learning for automatic latent variable selection in multi-output Gaussian processes.

problem Challenges in determining the adequate number of latent processes and relying on centralized learning for privacy and computational issues.
method Proposes a hierarchical model with spike-and-slab priors for automatic latent process selection and variational inference-based federated learning algorithm.
result Demonstrates the advantageous features of the proposed federated approach through simulations and real-world data.

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.

Unified approach for non-stationary linear bandits with dynamic regret.

problem Non-stationary linear bandits with round-specific feasible actions and drifting reward models.
method Unified misspecification-reduction viewpoint, restarting algorithms with misspecification-dependent regret guarantees.
result Optimal \(T^{2/3}P_T^{1/3}\) dynamic-regret dependence for both linear bandits and contextual linear bandits.

Bayesian bandit algorithms with approximate inference improve regret bounds in stochastic linear bandits.

problem Theoretical justification for Bayesian bandit algorithms with approximate inference in stochastic linear bandits.
method Proposed a theoretical framework to analyze approximate inference impact and conducted frequentist regret analysis on LinTS and LinBUCB.
result LinTS and LinBUCB preserve their original regret upper bounds with larger constant terms in approximate inference settings.

A new algorithm improves stochastic linear bandit performance using residual bootstrap.

problem Improving performance in stochastic linear bandit problems.
method Residual bootstrap exploration to estimate mean reward and pull the arm with the highest estimate.
result Proposed algorithm exttt{LinReBoot} achieves high-probability sub-linear regret under mild conditions.

Optimizes pure exploration in linear bandits with a new algorithm.

problem Best-arm identification in linear stochastic bandits.
method Developed the first asymptotically optimal algorithm for fixed-confidence pure exploration in linear bandits.
result Avoids the pitfall of a simple but difficult instance and bypasses the need to solve an optimal design problem.

New approach reduces unconstrained linear bandits to simpler optimization problems.

problem Unconstrained linear bandits problem.
method Perturbation-based approach combined with comparator-adaptive OLO algorithms.
result First high-probability guarantees for both static and dynamic regret in unconstrained linear bandits.

This paper achieves optimal regret bounds for locally private linear contextual bandit.

problem Designing locally private linear contextual bandit algorithms with optimal regret bounds.
method New algorithmic and analytical ideas, including mean absolute deviation analysis and layered principal component regression.
result Achieves an ildeO(T) ilde O(\sqrt{T}) regret upper bound for locally private linear contextual bandit.

Randomized exploration in linear bandits achieves optimal regret bounds.

problem Optimizing exploration in high-dimensional linear bandit problems.
method Analysis of Thompson sampling without forced optimism.
result Randomized exploration algorithms achieve an O(dnlog(n))O(d\sqrt{n} \log(n)) regret bound in smooth, strongly convex action spaces.

The paper presents a novel approach to multi-output regression using probabilistic circuits.

problem Capturing correlations between multiple output dimensions in large-scale regression problems.
method Employing a mixture of single-output Gaussian process experts encoded via a probabilistic circuit.
result The method can capture correlations between output dimensions and often outperforms other approaches.

New kernel models multi-output Gaussian processes accurately.

problem Challenges in modelling cross-covariances for multiple-output Gaussian processes.
method Replaced Gaussian components with block components of finite bandwidth in spectral mixture kernel.
result First multi-output generalization of spectral mixture kernel that can approximate any stationary multi-output kernel to arbitrary precision.

Algorithm balances online and offline data for linear bandits.

problem Online learning with an offline dataset in linear bandits.
method Proposes a linear bandit algorithm that uses offline data early and increasingly favors exploration as the horizon grows.
result Establishes regret bounds showing competitive performance with both purely online and offline solutions.

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.

Multi-output Gaussian processes (MOGPs) leverage the flexibility and interpretability of GPs while capturing structure across outputs, which is desirable, for example, in spatio-temporal modelling. The key problem with MOGPs is their computational scaling O(n3p3)O(n^3 p^3), which is cubic in the number of both inputs nn (e…

2019-11-14abs ↗pdf ↗

Multi-output Gaussian processes (MOGPs) are an extension of Gaussian Processes (GPs) for predicting multiple output variables (also called channels, tasks) simultaneously. In this paper we use the convolution theorem to design a new kernel for MOGPs, by modeling cross channel dependencies through cross convolution of t…

2018-08-07abs ↗pdf ↗