AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

The Adaptive Complexity of Minimizing Relative Fisher Information

Huanjian Zhou, Masashi Sugiyama

NeurIPS 2025 · Learning theory and algorithms › Sample complexity · approach: Learning under log-concave distributions · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Initiates the study of adaptive complexity (number of sequential rounds) of non-log-concave sampling by framing it as minimizing relative Fisher information.

Problem

Non-log-concave sampling from unnormalized densities is central to ML and statistics, but sampling algorithms need many sequential rounds, and the adaptive complexity of this problem has not been studied.

Approach

Studies the adaptive complexity of non-log-concave sampling within the framework of minimizing relative Fisher information, aiming to reduce the number of sequential rounds rather than total gradient evaluations.

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy