arXiv Machine Learning By Arul Rhik Mazumder, Elias Towe

An End-to-End Hybrid Quantum-Classical Sampling Workflow for Discrete Markov Random Fields: A Reproducible Case Study

Read the original on arXiv Machine Learning →

The paper presents an end‑to‑end hybrid quantum‑classical workflow for sampling from discrete Markov random fields (MRFs). By precomputing the $2^n$ target probabilities classically, the authors compare amplitude‑encoded quantum sampling against several modern classical MCMC methods across 60 instances from five graph families, finding that classical samplers achieve mean effective sample size (ESS) ratios close to the quantum approach. Wall‑clock benchmarks show that exact inverse‑CDF sampling outperforms the quantum sampler by a factor of 36 on average, and that matrix product state (MPS) techniques yield far higher fidelities than variational quantum circuits (VQC) at comparable compression budgets.

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 AI
Jun 10

Sample Where You Struggle: Sharpening Base Model Reasoning via Entropy-Guided Power Sampling

arXiv:2606. 09926v1 Announce Type: cross Abstract: Sampling from the sequence-level power distribution $p^\alpha$ elicits RL-level reasoning from base language models without any parameter updates, but the standard Metropolis--Hastings (MH), a Markov Chain Monte Carlo (MCMC) sampler, is both expensive and slow-mixing.

By Hong Guo, Nianhui Guo, Christoph Meinel, Haojin Yang