Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Compositional exemplars for in-context learning
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 …
ability, where the model learns to do an unseen task simply by conditioning on a prompt …
Optimal experimental design: Formulations and computations
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 …
natural and social sciences, engineering applications, and beyond. Optimal experimental …
Fast greedy map inference for determinantal point process to improve recommendation diversity
The determinantal point process (DPP) is an elegant probabilistic model of repulsion with
applications in various machine learning tasks including summarization and search …
applications in various machine learning tasks including summarization and search …
Determinantal point processes for machine learning
Determinantal point processes (DPPs) are elegant probabilistic models of repulsion that
arise in quantum physics and random matrix theory. In contrast to traditional structured …
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
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 …
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
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 …
evaluate. We formalize this task as a multiarmed bandit problem, where the payoff function is …
[BOEK][B] Handbook of spatial statistics
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 …
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.
When monitoring spatial phenomena, which can often be modeled as Gaussian processes
(GPs), choosing sensor locations is a fundamental task. There are several common …
(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 …
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 …
supermodular functions subject to a single matroid constraint. Specifically, we consider the …