Compositional exemplars for in-context learning

J Ye, Z Wu, J Feng, T Yu… - … Conference on Machine …, 2023 - proceedings.mlr.press
Large pretrained language models (LMs) have shown impressive In-Context Learning (ICL)
ability, where the model learns to do an unseen task simply by conditioning on a prompt …

Optimal experimental design: Formulations and computations

X Huan, J Jagalur, Y Marzouk - Acta Numerica, 2024 - cambridge.org
Questions of 'how best to acquire data'are essential to modelling and prediction in the
natural and social sciences, engineering applications, and beyond. Optimal experimental …

Fast greedy map inference for determinantal point process to improve recommendation diversity

L Chen, G Zhang, E Zhou - Advances in Neural Information …, 2018 - proceedings.neurips.cc
The determinantal point process (DPP) is an elegant probabilistic model of repulsion with
applications in various machine learning tasks including summarization and search …

Determinantal point processes for machine learning

A Kulesza, B Taskar - Foundations and Trends® in Machine …, 2012 - nowpublishers.com
Determinantal point processes (DPPs) are elegant probabilistic models of repulsion that
arise in quantum physics and random matrix theory. In contrast to traditional structured …

Gaussian process optimization in the bandit setting: No regret and experimental design

N Srinivas, A Krause, SM Kakade, M Seeger - arxiv preprint arxiv …, 2009 - arxiv.org
Many applications require optimizing an unknown, noisy function that is expensive to
evaluate. We formalize this task as a multi-armed bandit problem, where the payoff function …

Information-theoretic regret bounds for gaussian process optimization in the bandit setting

N Srinivas, A Krause, SM Kakade… - IEEE transactions on …, 2012 - ieeexplore.ieee.org
Many applications require optimizing an unknown, noisy function that is expensive to
evaluate. We formalize this task as a multiarmed bandit problem, where the payoff function is …

[BOEK][B] Handbook of spatial statistics

AE Gelfand, P Diggle, P Guttorp, M Fuentes - 2010 - taylorfrancis.com
Assembling a collection of very prominent researchers in the field, the Handbook of Spatial
Statistics presents a comprehensive treatment of both classical and state-of-the-art aspects …

[PDF][PDF] Near-optimal sensor placements in Gaussian processes: Theory, efficient algorithms and empirical studies.

A Krause, A Singh, C Guestrin - Journal of Machine Learning Research, 2008 - jmlr.org
When monitoring spatial phenomena, which can often be modeled as Gaussian processes
(GPs), choosing sensor locations is a fundamental task. There are several common …

A note on maximizing a submodular set function subject to a knapsack constraint

M Sviridenko - Operations Research Letters, 2004 - Elsevier
A note on maximizing a submodular set function subject to a knapsack constraint -
ScienceDirect Skip to main contentSkip to article Elsevier logo Journals & Books Help …

Optimal approximation for submodular and supermodular optimization with bounded curvature

M Sviridenko, J Vondrák… - Mathematics of Operations …, 2017 - pubsonline.informs.org
We design new approximation algorithms for the problems of optimizing submodular and
supermodular functions subject to a single matroid constraint. Specifically, we consider the …