English
Related papers

Related papers: Oracle approach and slope heuristic in context tre…

200 papers

Context-aware database has drawn increasing attention from both industry and academia recently by taking users' current situation and environment into consideration. However, most of the literature focus on individual context, overlooking…

Databases · Computer Science 2014-04-15 Xiaolu Lu , Dongxu Li , Xiang Li , Ling Feng

The prevailing mindset is that a single decision tree underperforms classic random forests in testing accuracy, despite its advantages in interpretability and lightweight structure. This study challenges such a mindset by significantly…

Machine Learning · Computer Science 2024-11-27 Qiangqiang Mao , Yankai Cao

Conditional stochastic optimization covers a variety of applications ranging from invariant learning and causal inference to meta-learning. However, constructing unbiased gradient estimators for such problems is challenging due to the…

Optimization and Control · Mathematics 2024-06-04 Yifan Hu , Siqi Zhang , Xin Chen , Niao He

In this paper, by treating in-context learning (ICL) as a meta-optimization process, we explain why LLMs are sensitive to the order of ICL examples. This understanding leads us to the development of Batch-ICL, an effective, efficient, and…

Machine Learning · Computer Science 2024-06-06 Kaiyi Zhang , Ang Lv , Yuhan Chen , Hansen Ha , Tao Xu , Rui Yan

Parsing accuracy using efficient greedy transition systems has improved dramatically in recent years thanks to neural networks. Despite striking results in dependency parsing, however, neural models have not surpassed state-of-the-art…

Computation and Language · Computer Science 2016-12-21 James Cross , Liang Huang

Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithms (e.g., clustering, conditioning) are effective only if the problem has a sparse graph captured by…

Artificial Intelligence · Computer Science 2013-02-18 Yousri El Fattah , Rina Dechter

Penalized least squares estimation is a popular technique in high-dimensional statistics. It includes such methods as the LASSO, the group LASSO, and the nuclear norm penalized least squares. The existing theory of these methods is not…

Statistics Theory · Mathematics 2017-07-10 Pierre C. Bellec , Guillaume Lecué , Alexandre B. Tsybakov

In this paper, we develop new first-order method for composite non-convex minimization problems with simple constraints and inexact oracle. The objective function is given as a sum of "`hard"', possibly non-convex part, and "`simple"'…

Optimization and Control · Mathematics 2017-03-28 Pavel Dvurechensky

Offline model-based reinforcement learning (MBRL) enhances data efficiency by utilizing pre-collected datasets to learn models and policies, especially in scenarios where exploration is costly or infeasible. Nevertheless, its performance…

Machine Learning · Computer Science 2025-03-04 Haohong Lin , Wenhao Ding , Jian Chen , Laixi Shi , Jiacheng Zhu , Bo Li , Ding Zhao

Reference-based metrics that operate at the sentence-level typically outperform quality estimation metrics, which have access only to the source and system output. This is unsurprising, since references resolve ambiguities that may be…

Computation and Language · Computer Science 2024-04-03 Vikas Raunak , Tom Kocmi , Matt Post

We prove oracle inequalities for a penalized log-likelihood criterion that hold even if the data are not independent and not stationary, based on a martingale approach. The assumptions are checked for various contexts: density estimation…

Statistics Theory · Mathematics 2024-05-20 Julien Aubert , Luc Lehéricy , Patricia Reynaud-Bouret

Zou [J. Amer. Statist. Assoc. 101 (2006) 1418-1429] proposed the Adaptive LASSO (ALASSO) method for simultaneous variable selection and estimation of the regression parameters, and established its oracle property. In this paper, we…

Statistics Theory · Mathematics 2013-07-09 A. Chatterjee , S. N. Lahiri

This paper presents a new framework for anytime heuristic search where the task is to achieve as many goals as possible within the allocated resources. We show the inadequacy of traditional distance-estimation heuristics for tasks of this…

Artificial Intelligence · Computer Science 2015-03-19 D. Davidov , S. Markovitch

The ability to explain why a machine learning model arrives at a particular prediction is crucial when used as decision support by human operators of critical systems. The provided explanations must be provably correct, and preferably…

Machine Learning · Computer Science 2026-05-06 John Törnblom , Emil Karlsson , Simin Nadjm-Tehrani

This thesis tackles the problem of learning efficient representations of complex, structured data with a natural application to web page and element classification. We hypothesise that the context around the element inside the web page is…

Machine Learning · Computer Science 2021-11-09 Cedric Cook

We consider the problem of how to improve automatic target recognition by fusing the naive sensor-level classification decisions with "intuition," or context, in a mathematically principled way. This is a general approach that is compatible…

Artificial Intelligence · Computer Science 2018-06-01 Christopher A. George , Pranab Banerjee , Kendra E. Moore

Many efficient algorithms with strong theoretical guarantees have been proposed for the contextual multi-armed bandit problem. However, applying these algorithms in practice can be difficult because they require domain expertise to build…

Machine Learning · Computer Science 2018-10-23 Adam N. Elmachtoub , Ryan McNellis , Sechan Oh , Marek Petrik

Text-to-image diffusion models have achieved remarkable generative capabilities, yet accurately aligning complex textual prompts with synthesized layouts remains an ongoing challenge. In these models, the initial Gaussian noise acts as a…

Computer Vision and Pattern Recognition · Computer Science 2026-04-28 Haosen Li , Wenshuo Chen , Lei Wang , Shaofeng Liang , Haozhe Jia , Yutao Yue

We develop a theoretical framework for the analysis of oblique decision trees, where the splits at each decision node occur at linear combinations of the covariates (as opposed to conventional tree constructions that force axis-aligned…

Statistics Theory · Mathematics 2023-09-01 Matias D. Cattaneo , Rajita Chandak , Jason M. Klusowski

Speculative decoding promises faster inference for large language models (LLMs), yet existing methods fail to generalize to real-world settings. Benchmarks typically assume short contexts (e.g., 2K tokens), whereas practical workloads…

Computation and Language · Computer Science 2025-10-10 Jaeseong Lee , seung-won hwang , Aurick Qiao , Gabriele Oliaro , Ye Wang , Samyam Rajbhandari