ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Gaussian-neighbor soft labels”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.CVEmpiricalRecentJul 1, 2026

Relation-Centric Open-Vocabulary 3D Gaussian Segmentation

Eunsung Cha, Hyunjoon Lee, Jaesik Park

This paper proposes PairGS, a framework for open-vocabulary 3D Gaussian segmentation that models pairwise relations between Gaussians using rich signals from 3D Gaussian representations.

View →
cs.LGcs.AIstat.APRecentMay 29, 2026

When Softmax Fails at the Top: Extreme Value Corrections for InfoNCE

Melihcan Erol, Suat Evren, Oktay Ozel, Alexander Morgan +2 more

The paper proposes WEINCE, a modified InfoNCE objective that uses extreme value theory corrections to improve contrastive learning by more accurately modeling the selection of hard negative examples.

View →
cs.LGcs.AIRecentMay 31, 2026

HASTE: Hardware-Aware Dynamic Sparse Training for Large Output Spaces

Nasib Ullah, Jinbin Zhang, Jean Lucien Randrianantenaina, Erik Schultheis +1 more

HASTE introduces group-shared fixed fan-in sparsity for multi-label classification, achieving significant wall-clock speedups (up to 25x in backward pass) by enabling efficient GPU execution while mai…

View →
cs.LGcs.CLRecentMay 31, 2026

Trust Functions: Near-Lossless Weak-to-Strong Generalization by Learning When to Trust the Weak Teacher

Arda Uzunoglu, Alvin Zhang, Daniel Khashabi

The paper introduces trust functions to filter weak supervision labels, enabling near-lossless weak-to-strong generalization by selectively training a strong student using only the most reliable weak…

View →
math.PRcs.ITmath.MGTheoreticalRecentJul 15, 2026

Stochastic Domination of Gaussian Maxima: A Resolution to the Weak Simplex Conjecture

Abhijeet Mulgund

The paper proves a stochastic comparison for Gaussian maxima, resolving the Weak Simplex Conjecture and proving the Simplex Mean Width Conjecture.

View →
stat.MLcs.CCcs.DSTheoreticalRecentJul 7, 2026

Boosting with List-Decodable Codes

Addison Prairie, Li-Yang Tan

A new boosting algorithm that strong learns concept classes closed under O(log 1/γ)-XOR using O(log 1/ε) calls to a γ-advantage weak learner and additional samples, by connecting boosting with list-de…

View →
cs.CVcs.AIRecentMay 28, 2026

GiPL: Generative augmented iterative Pseudo-Labeling for Cross-Domain Few-Shot Object Detection

Jiacong Liu, Shu Luo, Yikai Qin, Yaze Zhao +2 more

GiPL proposes a novel two-branch framework combining iterative pseudo-label self-training and generative data augmentation to significantly improve Cross-Domain Few-Shot Object Detection by better uti…

View →
cs.CLcs.LGRecentJun 1, 2026

Machine Learning for Coding Retail Product Names to Consumer-Price Categories: A Rule-plus-Bag-of-Words Pipeline with Reliability-Weighted Human-in-the-Loop Labeling

Vladimir Beskorovainyi

The paper proposes a robust, multi-stage pipeline combining rule-based classification and machine learning to map noisy retail product names to standardized consumption categories, finding that simple…

View →
cs.LGcs.AIcs.CVEmpiricalRecentJul 3, 2026

CuBAS: Information Geometric Curvature-Based Adaptive Sampling for Supervised Classification

Alexandre L. M. Levada

This paper introduces CuBAS, an adaptive data selection method for supervised classification based on curvature estimation from a labeled dataset using the Potts MRF model.

View →
cs.LGmath.PRstat.MLTheoreticalRecentJul 7, 2026

Quantitative Gaussian-Process limits of Tensor Programs

Andrea Agazzi, Eloy Mosig García, Dario Trevisan

This paper provides explicit error bounds for the infinite-width Gaussian-process limit of random neural networks using tensor programs and quantitative convergence theory in Wasserstein distance.

View →
cs.CVcs.AIRecentMay 29, 2026

On Revisiting Entropy for Identifying Mislabeled Images

Chunlei Li, Zixuan Zheng, Yilei Shi, Guanglu Dong +4 more

The paper proposes a Signed Entropy Integral (SEI) statistic to detect mislabeled images in training datasets by analyzing the temporal trend of prediction entropy, achieving state-of-the-art results…

View →
cs.LGstat.MLEmpiricalRecentJul 26, 2026

Soft-Constrained Optimization of Latent Space in Variational Autoencoders

Ye Shi

This paper proposes methods to improve the encoding capacity and disentanglement of Variational Autoencoders (VAE) by imposing entropy-based constraints and a weight-filter method.

View →
cs.AIRecentMay 27, 2026

FedMPT: Federated Multi-label Prompt Tuning of Vision-Language Models

Xucong Wang, Pengkun Wang, Zhe Zhao, Liheng Yu +2 more

FedMPT introduces a novel federated learning framework for Multi-Label Recognition (MLR) using Vision-Language Models (VLMs) by leveraging generalizable conditions to mitigate label overfitting and im…

View →
stat.MLcs.LGRecentJun 1, 2026

Doing well with less! On Sampling Techniques for Empirical Pairwise Loss Estimation/Minimization

Louise Davy, Stephan Clémençon, Charlotte Laclau

This paper introduces survey sampling techniques to estimate or minimize empirical pairwise loss functions, showing that targeting informative pairs significantly reduces computational cost while main…

View →
cs.LGcs.AIRecentJun 1, 2026

GJDNet: Robust Graph Neural Networks via Joint Disentangled Learning Against Adversarial Attacks

Canyixing Cui, Tao Wu, Xingping Xian, Xiao-Ke Xu +2 more

GJDNet proposes a joint disentanglement framework to enhance the robustness of Graph Neural Networks against adversarial attacks by simultaneously stabilizing node representations and decision boundar…

View →
econ.EMmath.STstat.METheoreticalRecentJul 27, 2026

Debiased Machine Learning: Identification, Estimation, and Shape Constraints

Qihui Chen, Ka Yan Cheng, Zheng Fang

This paper develops a framework for identifying and estimating parameters of interest in automatic debiased machine learning using a Riesz representer, which is identified when it uniquely optimizes a…

View →