Tag
A user announces that their paper has been accepted to NeurIPS with review scores of 5-4-4, and they expect a formal notification soon.
Apple combines machine learning and homomorphic encryption to enable private server lookups for features like Enhanced Visual Search for Photos, and open-sources an HE library for developers.
LEANN is a new vector indexing method that reduces storage requirements by about 97% through graph simplification and real-time embedding computation, while maintaining retrieval recall close to full HNSW. It is suitable for use on laptops and won the Best Paper award at MLSys 2026.
The article likely presents research on contrastive language models, exploring the use of contrastive learning techniques in language model development.
DualRes is a compact oscillatory state-space model for machine fault diagnosis from vibration data, achieving state-of-the-art performance with limited labels and reduced computational requirements for edge deployment.
This review article synthesizes active learning research for biodiversity monitoring, addressing label efficiency and highlighting the need for methods that support validation and reliable ecological inference.
This paper introduces a framework using AUC bounds as a differentiable objective for anomaly-free self-optimization of anomaly detection systems, achieving performance gains over conventional model selection methods.
This paper introduces a discrete diffusion model using variational autoregressive networks to parameterize normalized probability distributions, applied to Ising models for accurate thermodynamic computations and enhanced Monte Carlo sampling.
This paper proposes a full-covariance smoothing technique for Bayesian neural networks to enable efficient online adaptation by propagating correlations through nonlinear activations, demonstrated in tasks like classification and control.
This paper proposes a tail-aware geometry learning framework for conformal ellipsoids that decouples tail sensitivity from coverage guarantees, improving uncertainty quantification in multivariate settings.
This paper introduces a dual-model masking metric to benchmark ten explainable methods for temporal attribution in sequential recommendation systems, finding that gradient-based methods like GradientSHAP and Integrated Gradients yield the most faithful and robust attributions.
This paper proposes a method for learning risk scores from observational data that are robust to unobserved confounding, using sensitivity analysis and Wasserstein distributionally robust optimization. The approach improves calibration over traditional benchmarks and state-of-the-art methods.
The paper introduces Polymer Benchmark 2026, an open dataset for benchmarking machine learning methods in polymer property prediction across diverse architectures and properties.
The paper presents FAPE, a framework for fairness auditing in production ML, evaluating Fairlearn's ThresholdOptimizer across eight domains to show constraints help in high-disparity cases but can harm near-fair ones, advocating for continuous monitoring.
The paper proposes LWCal, a CPU-only post-hoc calibration method for tabular classifiers that handles noisy calibration labels without requiring clean data, showing improved calibration error and scoring metrics.
This paper introduces spectral updates for local learning that enhance depth robustness and reduce hyperparameter sensitivity, achieving better accuracy than local Adam on CIFAR-10 benchmarks.
This paper introduces Reachability-Induced Optimization (RIO) to argue that global optimization claims in AI systems should be based on the actually reachable region, providing theoretical results and benchmark data to support this framework.
This paper evaluates pre-trained models for pedagogical assessment of AI-assisted educational questions, finding that LLMs outperform traditional models and that strategic enhancements can improve out-of-distribution performance.
This paper applies Minimum Risk Training to small language models for power outage report generation, improving accuracy from 16.20% to 68.95% by optimizing sequence-level evaluation metrics.
This paper proposes a method to estimate the causal effect of benchmark exposure on AI model performance, moving beyond traditional overlap techniques for more robust evaluation.