Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

72144215287 · Jun 202019922001200920172026
48 results for binary labels

Binary PheNorm extends phenotype labeling for EHRs using binary silver labels.

problem Lack of gold-standard phenotype labels in EHR studies.
method Proposes Binary PheNorm, an extension that uses binary silver labels directly in phenotype scoring.
result Binary PheNorm achieved strong discrimination using binary labels alone and improved performance when combined with count labels.

Binary classification improves with a small fraction of corrupted labels.

problem Binary classification with corrupted labels.
method Established corruption as a form of regularization and computed upper bounds on estimation error.
result Corruption is beneficial only up to a small fraction of the total sample, scaling with the square root of the sample size.

Paper proposes Pcomp classification for binary classification with pairwise confidence comparisons.

problem Lack of pointwise labels due to privacy, confidentiality, or security reasons.
method Developed Pcomp classification, derived an unbiased risk estimator (URE), and improved it using correction functions and consistency regularization.
result Demonstrated the effectiveness of Pcomp classification methods.

Efficiently poisons offline RLHF models by flipping preference labels.

problem Vulnerability of offline RLHF models to preference label flipping attacks.
method Developed two attack methods: BAL-A and BMP-A, solving a structured binary sparse approximation problem.
result Demonstrated that flipping one preference label induces a parameter-independent shift in the DPO gradient, enabling structured binary sparse approximation.

Sharp bounds on uniform generalization errors in binary linear classification.

problem Understanding the uniform generalization errors in binary linear classification.
method Isoperimetric arguments, Poincaré and log-Sobolev inequalities for joint distributions.
result Sharp concentration bounds on uniform generalization errors, almost sure convergence in broad settings.

Ridge regression shows different behaviors in binary classification with noisy labels.

problem Binary classification with noisy labels and anisotropic cluster distributions.
method Investigation of ridge regression behavior in overparameterized settings with label noise.
result Ridge regression exhibits qualitatively different behavior based on the scale of cluster mean vectors and covariance matrices.

New research shows that binary classification can be done with noisy data, but only if there are clean samples available.

problem Learning binary classification with instance and label dependent label noise.
method Theoretical analysis and empirical risk minimization.
result Empirical risk minimization achieves the optimal excess risk bound without additional assumptions.

Class imbalance is an intrinsic characteristic of multi-label data. Most of the labels in multi-label data sets are associated with a small number of training examples, much smaller compared to the size of the data set. Class imbalance poses a key challenge that plagues most multi-label learning methods. Ensemble of Cl…

2018-07-30abs ↗pdf ↗

Bird sound data collected with unattended microphones for automatic surveys, or mobile devices for citizen science, typically contain multiple simultaneously vocalizing birds of different species. However, few works have considered the multi-label structure in birdsong. We propose to use an ensemble of classifier chain…

2013-04-22abs ↗pdf ↗

We study the natural map eta between a group of binary planar trees whose leaves are labeled by elements of a free abelian group H and a certain group D(H) derived from the free Lie algebra over H. Both of these groups arise in several different topological contexts. The map eta is known to be an isomorphism over Q, bu…

2005-04-13abs ↗pdf ↗

New method improves LLM judge accuracy by accounting for dependencies in aggregated binary labels.

problem Classical label aggregation methods fail to account for dependencies among LLM judges, leading to miscalibrated predictions.
method Dependence-aware models based on Ising graphical models and latent factors.
result The proposed method outperforms classical methods on real-world datasets, reducing excess risk.

Convolutional neural network (CNN)-based feature learning has become state of the art, since given sufficient training data, CNN can significantly outperform traditional methods for various classification tasks. However, feature learning becomes more difficult if some training labels are noisy. With traditional regular…

2019-12-06abs ↗pdf ↗

The paper studies how to use AI-generated labels in econometrics to avoid bias.

problem Small misclassification errors in AI-generated labels can lead to large biases in econometric estimators.
method The paper proposes a coupled-label bootstrap method to correct bias and deliver valid inference.
result The coupled-label bootstrap method is valid without the strong independence condition between true and imputed labels.

In many applications of classifier learning, training data suffers from label noise. Deep networks are learned using huge training data where the problem of noisy labels is particularly relevant. The current techniques proposed for learning deep networks under label noise focus on modifying the network architecture and…

2017-12-27abs ↗pdf ↗

We propose a new problem formulation which is similar to, but more informative than, the binary multiple-instance learning problem. In this setting, we are given groups of instances (described by feature vectors) along with estimates of the fraction of positively-labeled instances per group. The task is to learn an ins…

2012-07-04abs ↗pdf ↗

New method calibrates multi-class predictions efficiently without sacrificing accuracy.

problem Efficiently calibrating multi-class predictions without sacrificing accuracy.
method Formulated robust projected smooth calibration and new recalibration algorithms.
result Achieves strong guarantees for binary classification tasks with polynomial complexity.

Quantum circuits represent binary classification trees with binary features.

problem Classifying data using binary classification trees with binary features.
method Quantum circuits and probabilistic approach for traversing decision trees.
result First realization of a decision tree classifier on a quantum device.

New loss functions improve extreme classification with missing labels.

problem Large number of infrequent labels and missing labels in XMC.
method Derive unbiased loss functions for XMC, incorporating them into existing algorithms.
result Significant improvement in extreme classification performance (up to 20%) over existing methods.

The number of possible methods of generalizing binary classification to multi-class classification increases exponentially with the number of class labels. Often, the best method of doing so will be highly problem dependent. Here we present classification software in which the partitioning of multi-class classification…

2014-04-15abs ↗pdf ↗

New method estimates hidden binary mixture model centers efficiently.

problem Estimating centers in high-dimensional binary mixture models with hidden Markov structure.
method Proposes a minimax optimal procedure and an adaptive variant.
result Achieves optimal rate of order δd/n+d/n\sqrt{δd/n} + d/n.

In this paper, we investigate the degree to which the encoding of a ββ-VAE captures label information across multiple architectures on Binary Static MNIST and Omniglot. Even though they are trained in a completely unsupervised manner, we demonstrate that a ββ-VAE can retain a large amount of label information, even w…

2018-12-06abs ↗pdf ↗

New methods lift weak supervision to structured prediction, providing robustness guarantees.

problem Applying weak supervision techniques to structured prediction problems.
method Introducing pseudo-Euclidean embeddings, tensor decompositions, and invariants for consistent noise rate estimation.
result Generalization guarantees nearly identical to those for models trained on clean data.

Estimates binary labels from dependent data using Markov Random Fields.

problem Statistical estimation from dependent data across spatial, temporal, and social domains.
method Modeling dependencies as Markov Random Fields and providing efficient estimation algorithms.
result Statistically efficient estimation rates for Ising models from a single sample.

In this paper, we propose a compositional nonparametric method in which a model is expressed as a labeled binary tree of 2k+12k+1 nodes, where each node is either a summation, a multiplication, or the application of one of the qq basis functions to one of the pp covariates. We show that in order to recover a labeled bi…

2017-04-06abs ↗pdf ↗

Develops NPMC method for noisy labels, improving multiclass classification accuracy.

problem Asymmetric misclassification costs and label noise in multiclass classification.
method Empirical likelihood approach using exponential tilting density ratio model.
result Root n consistent and asymptotically normal estimators for clean labels and noise mechanism.

The paper explores how machine learning models can be learnable despite label shifts.

problem Learnability of binary classification models in the presence of label shifts.
method Developed a performative empirical risk function that is an unbiased estimate of the true risk on the shifted distribution.
result PAC-learnable hypothesis spaces remain PAC-learnable for performative scenarios.

Paper proposes methods to improve SVM classifiers in noisy data scenarios.

problem Improving SVM classifiers when training data contains label noise.
method Mixed Integer Linear and Non Linear models with relabeling and clustering.
result Effective methods improve SVM performance in noisy data scenarios.

Unified framework designs LK structures using integer twists on non-manifold meshes.

problem Binary twisting limits topological possibilities and structural behaviors.
method Generalizes twist formulation to arbitrary integer labels for non-manifold meshes.
result Integer twists enable full connectivity and dynamic folding/articulation.

We propose the Autoencoding Binary Classifiers (ABC), a novel supervised anomaly detector based on the Autoencoder (AE). There are two main approaches in anomaly detection: supervised and unsupervised. The supervised approach accurately detects the known anomalies included in training data, but it cannot detect the unk…

2019-03-26abs ↗pdf ↗