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

20 results for “Conformal prediction”

CS papers only

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

Want pure semantic search? Try claim verification →

math.STstat.MEstat.MLTheoreticalRecentJun 9, 2026

Conformal Prediction for Dyadic Regression Under Complex Missingness

Robert Lunde, Minjie Yang, Elizaveta Levina, Ji Zhu

This paper develops a framework for conformal prediction in dyadic regression problems under complex missingness mechanisms.

View →
cs.LGstat.MLTheoreticalRecentJun 9, 2026

Limitations of Learning Tanh Neural Networks with Finite Precision

Philipp Grohs, Matěj Trödler

This paper investigates limitations of learning tanh neural networks under finite-precision computations and Lp accuracy guarantees.

View →
cs.LGcs.AIstat.MLRecentMay 30, 2026

Multi-Agent Conformal Prediction with Personalized Statistical Validity

Martin V. Vejling, Christophe A. N. Biscio, Adrien Mazoyer, Petar Popovski +1 more

The paper proposes Personalized Federated Weighted Conformal Prediction (PFWCP), a novel framework that ensures statistically valid uncertainty quantification in multi-agent, heterogeneous settings wh…

View →
cs.LGcs.AIstat.MLRecentMay 27, 2026

Conf-Gen: Conformal Uncertainty Quantification for Generative Models

Gabriel Loaiza-Ganem, Kevin Zhang, Wei Cui, Marc T. Law +1 more

The paper introduces Conformal Generation (Conf-Gen), a novel framework that adapts conformal risk control to provide formal uncertainty guarantees for unsupervised generative models like LLMs and ima…

View →
cs.LGstat.MLRecentJun 2, 2026

Conformal Language Modeling via Posterior Sampling

Nicolas Emmenegger, Theo X. Olausson, Armando Solar-Lezama, Chara Podimata

The paper proposes sampling directly from approximations of an LLM posterior, conditioned on high-scoring regions, to generate more coherent and useful text compared to existing post-hoc hallucination…

View →
cs.AIRecentJun 1, 2026

Does Compression Preserve Uncertainty? A Unified Benchmark for Quantized and Sparse LLMs via Conformal Prediction

Yujia Tong, Yuxi Wang, Yunyang Wan, Tian Zhang +2 more

This paper investigates whether model compression techniques (like quantization and pruning) preserve a Large Language Model's ability to quantify its own uncertainty, finding that accuracy-only evalu…

View →
cs.LGcs.AIcs.CVRecentMay 31, 2026

UR-JEPA: Uniform Rectifiability as a Regularizer for Joint-Embedding Predictive Architectures

Triet M. Le

The paper proposes UR-JEPA, a novel regularizer for Joint-Embedding Predictive Architectures (JEPAs) that enforces uniform rectifiability, achieving superior performance and more structured representa…

View →
cs.LGcs.AIstat.MERecentMay 28, 2026

The Good, the Bad, and the Ugly of Markov Boundary for Tabular Prediction

Shu Wan, Abhinav Gorantla, Huan Liu, K. Selçuk Candan

While restricting a model to the theoretical Markov boundary can significantly improve prediction, the practical process of discovering and using this boundary is often computationally infeasible and…

View →
cs.CVRecentJun 1, 2026

From Extrinsic to Intrinsic: Geodesic-Guided Representation Learning for 3D Geometric Data

Yuming Zhao, Junhui Hou, Qijian Zhang, Jia Qin +1 more

The paper introduces PRISM, a novel representation learning framework that learns isometric embeddings by explicitly modeling the intrinsic geodesic metric of 3D surfaces, achieving superior performan…

View →
cs.LGRecentJun 1, 2026

Riemannian Gradient Descent for Low-Rank Architectures

Nicholas Knight

The paper investigates applying Riemannian optimization techniques to low-rank matrix parameters for deep learning, but finds that the proposed methods do not conclusively outperform the AdamW baselin…

View →
math.ATcs.CGmath-phRecentMay 27, 2026

Gauge Geometry of Hodge Zero-Mode Transport in Parameter-Dependent Topological Data Analysis

Satoshi Kanno, Rei Nishimura, Hiroshi Yamauchi, Yoshi-aki Shimada

The paper introduces a computational framework using Hodge zero-modes to track the geometry of topological features in parameter-dependent data, providing metrics like curvature and holonomy to quanti…

View →
cs.IRRecentJun 2, 2026

When Does Latent Reasoning Help? MeRa: Metric-Space Bias for Spatial Prediction

Zhenyu Yu, Shuigeng Zhou

The paper introduces MeRa, a metric-space bias module, demonstrating that latent reasoning only improves spatial prediction when it is explicitly grounded in the underlying metric space.

View →
cs.LGcs.AIcs.CVRecentMay 31, 2026

BRo-JEPA: Learning Modular Arithmetic in Latent Space

Divyansh Jha, Yuanfang Xie, Varan Mehra, Brennen Yu

The paper introduces BRo-JEPA, a latent world model that successfully learns modular arithmetic (like addition modulo 10) by explicitly imposing the circular structure of the problem into the latent s…

View →
cs.CVRecentJun 1, 2026

VISReg: Variance-Invariance-Sketching Regularization for JEPA training

Haiyu Wu, Randall Balestriero, Morgan Levine

VISReg introduces a novel regularization technique that combines variance control with a Sliced-Wasserstein-based sketching objective to stabilize self-supervised learning, achieving state-of-the-art…

View →
cs.LGRecentJun 1, 2026

Expressivity of congruence-based architectures for DNNs on positive-definite matrices

Antonin Oswald, Estelle Massart

The paper analyzes congruence-based neural architectures for classifying positive-definite matrices, demonstrating that common semi-orthogonality constraints severely limit the model's expressivity.

View →
cs.CVcs.AIcs.LGRecentMay 30, 2026

MoEIoU: Rethinking Bounding-Box Regression as a Mixture of Experts

Vinay Edula, Priyanka Bagade

The paper proposes MoEIoU, a novel mixture-of-experts based regression loss that adaptively models bounding-box localization errors, achieving superior convergence and accuracy in object detection.

View →
cs.LGcs.AIcs.CERecentJun 1, 2026

On the Generalization in Topology Optimization via Sensitivity-Conditioned Bernoulli Flow Matching

Mohammad Rashed, Duarte F. Valoroso Madeira, Babak Gholami, Caglar Guerbuez +2 more

The paper proposes using pseudo-sensitivities, derived from adjoint sensitivity fields, as an optimal conditioning signal in a Bernoulli flow-matching framework to significantly improve the out-of-dis…

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 →
cs.GRcs.CGRecentMay 30, 2026

Subgrid Marching Tetrahedra

Hossein Baktash, Mark Gillespie, Keenan Crane

The paper introduces a subgrid marching tetrahedra scheme that accurately recovers complex, intersection-free manifold meshes from tetrahedral grids, overcoming limitations of classic marching methods…

View →
cs.LGcs.AIRecentMay 31, 2026

A Fiber Criterion for Representation Identifiability in Supervised Learning

Vasileios Sevetlidis

The paper formalizes the problem of representation identifiability in supervised learning, showing that a representation property is identifiable if and only if it is constant across all possible fact…

View →