arXiv Machine Learning By Guan-Ju Peng

Honest Physical-Support Inference after Latent Dictionary Learning: Collision Singularities and Minimax Resolution

Read the original on arXiv Machine Learning →

arXiv:2607. 16813v1 Announce Type: new Abstract: Sparse-support uncertainty is usually quantified by treating the dictionary as known, an assumption that can produce overconfident, label-dependent conclusions when the dictionary is learned from latent sparse mixtures.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Aug 21

Physical-Support Confidence Sets for Highly Coherent Dictionaries

arXiv:2608. 20295v1 Announce Type: new Abstract: Sparse pursuit after dictionary learning can yield a precise atom support even when its physical interpretation is not justified by the calibration data, especially for highly coherent dictionaries where alternative calibration-compatible dictionaries may assign different physical meanings to the same selected support.

By Guan-Ju Peng
arXiv Machine Learning
1d ago

Symmetry Discovery in Quantum Learning: Observable-Level and Task-Level Inference from Finite Measurements

The paper develops a finite‑measurement framework for inferring the symmetry group that a quantum learning model should respect, based on candidate transformations and limited data. It shows that observable‑invisible transformations correspond to the stabilizer of a projected state when the probe span is invariant, and that recovered generators form a valid subgroup with a continuous invisible space identified via its Lie algebra. The authors introduce an unbiased shadow statistic that improves estimation rates, establish optimal gap dependence through a commuting‑qubit lower bound, and provide tools for task validation, bias quantification, and capacity analysis, all illustrated with Ising‑chain calculations.

By Zeyu Chen