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

20 results for “classifier guidance”

CS papers only

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

Want pure semantic search? Try claim verification →

math.STcs.LGmath.PREmpiricalRecentJun 4, 2026

How abundant are good interpolators?

August Y. Chen, Ahmed El Alaoui

This paper establishes a large deviation principle for the generalization error of interpolating classifiers in the overparametrized regime.

View →
eess.AScs.AIcs.LGEmpiricalRecentJun 18, 2026

Repurposing a Speech Classifier for Guided Diffusion-Based Speech Generation

Rostislav Makarov, Timo Gerkmann

The paper repurposes a pre-trained speech classifier as the backbone for diffusion generation, reducing the need for two separately trained models.

View →
stat.MLcs.LGEmpiricalRecentJun 28, 2026

Gradient boosting with vector-valued leafs

David Cortes

This paper extends gradient boosting to functions of vector inputs using a simple algorithm with histogram-based decision trees.

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.LGcs.AIRecentMay 30, 2026

Demystifying the Optimal Fair Classifier in Multi-Class Classification

Li Zhang, Yuyuan Li, XiaoHua Feng, Jiaming Zhang +2 more

This paper addresses the challenge of achieving optimal fairness and accuracy simultaneously in multi-class classification by proposing novel in-processing and post-processing algorithms that converge…

View →
cs.LGcs.AIRecentMay 29, 2026

From Rashomon Theory to PRAXIS: Efficient Decision Tree Rashomon Sets

Zakk Heile, Hayden McTavish, Varun Babbar, Margo Seltzer +1 more

The paper introduces PRAXIS, a novel algorithm that efficiently approximates the computation of 'Rashomon sets' for decision trees, significantly reducing memory and runtime complexity.

View →
stat.MLcs.LGEmpiricalRecentJun 12, 2026

Gradient boosting for extremes: sampling theory and application to insurance

Stéphane Lhaut, Olivier Lopez

This paper develops statistical learning theory for gradient boosting in Peaks-over-Threshold modeling using Generalized Pareto distributions, deriving error bounds and reducing gradient correlation.

View →
cs.AIcs.CLcs.CYRecentMay 29, 2026

On Wednesdays, We Ask Questions: Optimizing "Active Listening" in Automated Legal Triage and Referral

Quinten Steenhuis, Jacqueline Harvey

The paper evaluates an automated legal triage system (FETCH) that uses follow-up questions, demonstrating that while low-cost LLMs are effective for classification, generating high-quality questions r…

View →
cs.LGcs.CLEmpiricalRecentJul 8, 2026

Max Out GRPO Signal: Adaptive Trace Prefix Control for Hard Reasoning Problems

Vladislav Beliaev

The paper introduces AdaPrefix-GRPO, a method that adjusts the amount of reference solution assistance during training to improve the success rate and accuracy of Group Relative Policy Optimization (G…

View →
stat.MLcs.AIcs.LGRecentMay 29, 2026

Correcting Split Selection in Online Decision Trees via Anytime-Valid Inference

Salim I. Amoukou, Saumitra Mishra, Manuela Veloso

The paper introduces a new anytime-valid inference method to correct split selection in online decision trees, providing robust statistical guarantees for streaming data that existing methods lack.

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.AIRecentMay 29, 2026

ChurnNet: A Optimized Modern AI for Churn Prediction

Syed Saad Saif, Giulio Maggiore, Paolo Russo, Damiano Distante

This paper compares traditional machine learning models (Random Forests, XGBoost, SVM) against a complex Unified Multi-Task Time Series Model for churn prediction, concluding that conventional methods…

View →
cs.CVcs.AIEmpiricalRecentJun 12, 2026

Rethinking Global Average Pooling: Your Classifier Is Secretly a Multi-Instance Learner

Aray Karjauv

This paper demonstrates that standard image classifiers can be interpreted as multiple-instance learning models, allowing for the recovery of spatial class evidence from image-level logits.

View →
cs.NEcs.AIcs.DSRecentMay 28, 2026

Selection Hyper-heuristics Can Automatically Adjust the Learning Period to Optimally Solve Pseudo-Boolean Problems

Benjamin Doerr, Pietro S. Oliveto, John Alasdair Warwicker

This paper introduces a method to automatically determine the optimal learning period ($ au$) for the Random Gradient hyper-heuristic, enabling it to optimally solve Pseudo-Boolean Problems without ma…

View →
cs.LGcs.AIRecentMay 28, 2026

DAMEL: Dual-Axis Multi-Expert Learning for Class-Imbalanced Learning

Hyuck Lee, Taemin Park, Heeyoung Kim

The paper proposes DAMEL, a dual-axis multi-expert learning algorithm that simultaneously reduces both prediction bias and variance in class-imbalanced learning by leveraging multiple experts across b…

View →
eess.ASEmpiricalRecentJul 7, 2026

Few-Shot Class-Incremental Audio Classification Using Pseudo-Incrementally Trained Embedding Learner and Continually Updated Stochastic Classifier

Yanxiong Li, Wenchang Cao, Jiaxin Tan, Qianqian Li +1 more

This paper proposes a model for few-shot class-incremental audio classification, which consists of a pseudo-incrementally trained embedding learner and a continually updated stochastic classifier.

View →
stat.MLcs.LGEmpiricalRecentJul 23, 2026

Automatic knot selection in smooth additive models

Nicolás Carrizosa, Vanesa Guerrero, María Durbán

A new method for selecting knots in Generalized Additive Models using an extension of adaptive splines and a customized Fellner-Schall scheme.

View →
cs.IREmpiricalRecentJul 6, 2026

Prompting Beats Fine-Tuning: Generative Expected Value Scoring for Statutory Term Retrieval

Alvin Wang, Jaromir Savelka

The paper compares two families of methods for ranking case-law sentences by their usefulness for explaining statutory concepts using ModernBERT and decoder-only models. Decoder-only models achieve th…

View →
cs.HCEmpiricalRecentJul 21, 2026

Evaluating a Visual Query Tracer and Builder for Learning Declarative Logic Programming

Julián Méndez, Lukas Gerlach, Tobias Wieland, Alex Ivliev +2 more

The authors conducted a user study to assess the effectiveness of their interactive visual query tracer and builder tools for Nemo, a Datalog reasoner, in helping students learn Datalog.

View →