arXiv research

Boosting improves accuracy with fewer calls to weak learners for certain concept classes.

Polynomial-time algorithm for list-decodable linear regression with batches.

New method for estimating sparse means in noisy data.

Paper tackles high-accuracy list-decodable learning for mean estimation.

New algorithm for robust mean estimation in high dimensions with nearly-PCA time complexity.

Statistical Query lower bound shows difficulty in list-decodable linear regression.

Polynomial-time algorithm for estimating covariance in corrupted Gaussian data.

New algorithm recovers mixture means even with many outliers.

Algorithm estimates covariance from noisy data efficiently.

We give the first polynomial-time algorithm for robust regression in the list-decodable setting where an adversary can corrupt a greater than $1/2$ fraction of examples. For any $α< 1$, our algorithm takes as input a sample $\{(x_i,y_i)\}_{i \leq n}$ of $n$ linear equations where $αn$ of the equations satisfy $y_i = \l…

A simple model explains phase transition in large language models.

New method estimates mean from noisy data with few outliers.

New method certifies anti-concentration for various non-Gaussian distributions.

Study on list learning with noisy data, showing limits and some learnable cases.

New algorithm clusters data with almost-linear time, robust to corruption.

New algorithm for batch list-decodable linear regression with stronger guarantees.

Improved subspace recovery algorithm with dimension-independent error and polynomial time.

Paper tackles MLR prediction error without assuming realizable models.

Proves subgaussian distributions are SoS-certifiably subgaussian, enabling efficient algorithms for various statistical tasks.

Study shows private learning of mixtures of Gaussians is possible with polynomial samples.

Many software analysis methods have come to rely on machine learning approaches. Code segmentation - the process of decomposing source code into meaningful blocks - can augment these methods by featurizing code, reducing noise, and limiting the problem space. Traditionally, code segmentation has been done using syntact…

Study re-evaluates MIMIC-III codes, finding many are under-coded.

Paper proposes new gradient codes for robust distributed machine learning.

CoNCRA uses CNN to find code snippets matching developer intent.

Adversarial attacks found to be effective on code models.

Contrastive Code Representation Learning improves code summarization and type inference.

Transformer model improves source code summarization.

Investigates neural codes and their embeddings, proving conjectures and introducing new code types.

Characterization of a patient clinical phenotype is central to biomedical informatics. ICD codes, assigned to inpatient encounters by coders, is important for population health and cohort discovery when clinical information is limited. While ICD codes are assigned to patients by professionals trained and certified in c…

Sparse coding approximates the data sample as a sparse linear combination of some basic codewords and uses the sparse codes as new presentations. In this paper, we investigate learning discriminative sparse codes by sparse coding in a semi-supervised manner, where only a few training samples are labeled. By using the m…

Inspired by recent work on convex formulations of clustering (Lashkari & Golland, 2008; Nowozin & Bakir, 2008) we investigate a new formulation of the Sparse Coding Problem (Olshausen & Field, 1997). In sparse coding we attempt to simultaneously represent a sequence of data-vectors sparsely (i.e. sparse approximation (…

Topological theory for qLDPC codes enables non-Clifford gates and magic state injection.

We introduce new definitions of universal and superuniversal computable codes, which are based on a code's ability to approximate Kolmogorov complexity within the prescribed margin for all individual sequences from a given set. Such sets of sequences may be singled out almost surely with respect to certain probability …

We introduce the hemicubic codes, a family of quantum codes obtained by associating qubits with the $p$-faces of the $n$-cube (for $n>p$) and stabilizer constraints with faces of dimension $(p\pm1)$. The quantum code obtained by identifying antipodal faces of the resulting complex encodes one logical qubit into $N = 2^…

Code search and comprehension have become more difficult in recent years due to the rapid expansion of available source code. Current tools lack a way to label arbitrary code at scale while maintaining up-to-date representations of new programming languages, libraries, and functionalities. Comprehensive labeling of sou…

Gradient coding is a technique for straggler mitigation in distributed learning. In this paper we design novel gradient codes using tools from classical coding theory, namely, cyclic MDS codes, which compare favorably with existing solutions, both in the applicable range of parameters and in the complexity of the invol…

The design of codes for communicating reliably over a statistically well defined channel is an important endeavor involving deep mathematical research and wide-ranging practical applications. In this work, we present the first family of codes obtained via deep learning, which significantly beats state-of-the-art codes …

MISIM improves code similarity systems with neural learning.

Khovanov homology helps create quantum error-correcting codes.

Program comprehension is a fundamental task in software development and maintenance processes. Software developers often need to understand a large amount of existing code before they can develop new features or fix bugs in existing programs. Being able to process programming language code automatically and provide sum…

We discuss Gauss codes of virtual diagrams and virtual doodles. The notion of a left canonical Gauss code is introduced and it is shown that oriented virtual doodles are uniquely presented by left canonical Gauss codes.

Sparse codes improve optimal control tasks with correlated inputs.

Two new coding schemes improve the efficient communication of noisy data.

The abundance of open-source code, coupled with the success of recent advances in deep learning for natural language processing, has given rise to a promising new application of machine learning to source code. In this work, we explore the use of a Siamese recurrent neural network model on Python source code to create …

We use Khovanov homology to define families of LDPC quantum error-correcting codes: unknot codes with asymptotical parameters [[3^(2l+1)/sqrt(8πl);1;2^l]]; unlink codes with asymptotical parameters [[sqrt(2/2πl)6^l;2^l;2^l]] and (2,l)-torus link codes with asymptotical parameters [[n;1;d_n]] where d_n>\sqrt(n)/1.62.

Sparse coding has been popularly used as an effective data representation method in various applications, such as computer vision, medical imaging and bioinformatics, etc. However, the conventional sparse coding algorithms and its manifold regularized variants (graph sparse coding and Laplacian sparse coding), learn th…

In this paper we formalize a combinatorial object for describing link diagrams called a Planar Diagram Code. PD-codes are used by the KnotTheory Mathematica package developed by Bar-Natan, et al. We present the set of PD-codes as a stand alone object and discuss its relationship with link diagrams. We give an explicit …

Sparse coding, which represents a data point as a sparse reconstruction code with regard to a dictionary, has been a popular data representation method. Meanwhile, in database retrieval problems, learning the ranking scores from data points plays an important role. Up to now, these two problems have always been conside…