English
Related papers

Related papers: Extensions of Self-Improving Sorters

200 papers

Let $X_1, ..., X_m$ be a set of $m$ statistically dependent sources over the common alphabet $\mathbb{F}_q$, that are linearly independent when considered as functions over the sample space. We consider a distributed function computation…

Information Theory · Computer Science 2016-11-17 V. Lalitha , N. Prakash , K. Vinodh , P. Vijay Kumar , S. Sandeep Pradhan

In large-scale distributed scenarios, increasingly complex tasks demand more intelligent collaboration across networks, requiring the joint extraction of structural representations from data samples. However, conventional task-specific…

Machine Learning · Computer Science 2026-04-21 Zhuojun Tian , Chaouki Ben Issaid , Mehdi Bennis

Efficiently finding safe and feasible trajectories for mobile objects is a critical field in robotics and computer science. In this paper, we propose SIL-RRT*, a novel learning-based motion planning algorithm that extends the RRT* algorithm…

Robotics · Computer Science 2024-11-27 Xuzhe Dang , Stefan Edelkamp

We consider the problem of discrete-time signal denoising, focusing on a specific family of non-linear convolution-type estimators. Each such estimator is associated with a time-invariant filter which is obtained adaptively, by solving a…

Statistics Theory · Mathematics 2018-06-13 Dmitrii Ostrovskii , Zaid Harchaoui

The phase-ordering problem of modern compilers has received a lot of attention from the research community over the years, yet remains largely unsolved. Various optimization sequences exposed to the user are manually designed by compiler…

Machine Learning · Computer Science 2020-10-19 Rahim Mammadli , Ali Jannesari , Felix Wolf

Irregularly-sampled time series occur in many domains including healthcare. They can be challenging to model because they do not naturally yield a fixed-dimensional representation as required by many standard machine learning models. In…

Machine Learning · Computer Science 2020-08-19 Steven Cheng-Xian Li , Benjamin M. Marlin

We explore an extension to straight-line programs (SLPs) that outperforms, for some text families, the measure $\delta$ based on substring complexity, a lower bound for most measures and compressors exploiting repetitiveness (which are…

Data Structures and Algorithms · Computer Science 2024-02-16 Gonzalo Navarro , Cristian Urbina

Large language models show great potential in generating and optimizing code. Widely used sampling methods such as Nucleus Sampling increase the diversity of generation but often produce repeated samples for low temperatures and incoherent…

Machine Learning · Computer Science 2024-03-01 Dejan Grubisic , Chris Cummins , Volker Seeker , Hugh Leather

In this paper, we consider the order statistics from a newly-introduced lifetime distribution called the XLindley distribution. We have derived explicit closed form expressions for the single moments and product moments of order statistics…

Methodology · Statistics 2025-02-11 Zuber Akhter , S. M. T. K. MirMostafaee , Abu Bakar , Ehsan Ormoz

In many applications of supervised learning, multiple classification or regression outputs have to be predicted jointly. We consider several extensions of gradient boosting to address such problems. We first propose a straightforward…

Machine Learning · Statistics 2019-05-21 Arnaud Joly , Louis Wehenkel , Pierre Geurts

Information extraction (IE) has been studied extensively. The existing methods always follow a fixed extraction order for complex IE tasks with multiple elements to be extracted in one instance such as event extraction. However, we conduct…

Computation and Language · Computer Science 2024-03-26 Wenhao Huang , Jiaqing Liang , Zhixu Li , Yanghua Xiao , Chuanjun Ji

Learning discrete distributions from i.i.d. samples is a well-understood problem. However, advances in generative machine learning prompt an interesting new, non-i.i.d. setting: after receiving a certain number of samples, an estimated…

Information Theory · Computer Science 2026-01-06 Millen Kanabar , Michael Gastpar

In this paper we study noisy sorting without re-sampling. In this problem there is an unknown order $a_{\pi(1)} < ... < a_{\pi(n)}$ where $\pi$ is a permutation on $n$ elements. The input is the status of $n \choose 2$ queries of the form…

Data Structures and Algorithms · Computer Science 2007-07-10 Mark Braverman , Elchanan Mossel

For many real-world classification problems, e.g., sentiment classification, most existing machine learning methods are biased towards the majority class when the Imbalance Ratio (IR) is high. To address this problem, we propose a set…

Information Retrieval · Computer Science 2021-04-14 Yang Gao , Yi-Fan Li , Yu Lin , Charu Aggarwal , Latifur Khan

Continual learning aims to learn on non-stationary data streams without catastrophically forgetting previous knowledge. Prevalent replay-based methods address this challenge by rehearsing on a small buffer holding the seen data, for which a…

Machine Learning · Computer Science 2023-04-21 Zhicheng Sun , Yadong Mu , Gang Hua

In some scenarios, classifier requires detecting out-of-distribution samples far from its training data. With desirable characteristics, reconstruction autoencoder-based methods deal with this problem by using input reconstruction error as…

Computer Vision and Pattern Recognition · Computer Science 2023-03-30 Yibo Zhou

Contemporary machine learning applications often involve classification tasks with many classes. Despite their extensive use, a precise understanding of the statistical properties and behavior of classification algorithms is still missing,…

Machine Learning · Computer Science 2020-11-17 Christos Thrampoulidis , Samet Oymak , Mahdi Soltanolkotabi

A doubly type-II censored scheme is an important sampling scheme in the life testing experiment and reliability engineering. In the present commutation, we have considered estimating ordered scale parameters of two exponential distributions…

Statistics Theory · Mathematics 2024-12-09 Shrajal Bajpai , Lakshmi Kanta Patra

Let $\{X_{n}, n\ge 1\}$ be a sequence of independent random variables with common general error distribution $GED(v)$ with shape parameter $v>0$, and let $M_{n,r}$ denote the $r$th largest order statistics of $X_{1}, X_{2}, \cdots, X_{n}$.…

Probability · Mathematics 2019-05-07 Yingyin Lu , Zuoxiang Peng

Estimating properties of discrete distributions is a fundamental problem in statistical learning. We design the first unified, linear-time, competitive, property estimator that for a wide class of properties and for all underlying…

Machine Learning · Statistics 2019-04-02 Yi Hao , Alon Orlitsky , Ananda T. Suresh , Yihong Wu
‹ Prev 1 8 9 10 Next ›