MétaCan
Menu
Back to cohort

Universal Steering Criteria

2016· article· en· W2280334344 on OpenAlexafffund
Huangjun Zhu, Masahito Hayashi, Lin Chen

Bibliographic record

VenuePhysical Review Letters · 2016
Typearticle
Languageen
FieldMathematics
TopicNumerical methods in inverse problems
Canadian institutionsPerimeter Institute
FundersFundamental Research Funds for the Central UniversitiesInstitut Périmètre de physique théoriqueNational Natural Science Foundation of ChinaOntario Ministry of Research, Innovation and ScienceMinistry of Education, Culture, Sports, Science and TechnologyDeutsche ForschungsgemeinschaftMinistry of Education - SingaporeNational Research FoundationGovernment of Canada
KeywordsBipartite graphComputer scienceInequalityEntropy (arrow of time)Connection (principal bundle)MathematicsTheoretical computer scienceAlgorithmPhysicsMathematical analysisGeometry

Abstract

fetched live from OpenAlex

We propose a general framework for constructing universal steering criteria that are applicable to arbitrary bipartite states and measurement settings of the steering party. The same framework is also useful for studying the joint measurement problem. Based on the data-processing inequality for an extended Rényi relative entropy, we then introduce a family of steering inequalities, which detect steering much more efficiently than those inequalities known before. As illustrations, we show unbounded violation of a steering inequality for assemblages constructed from mutually unbiased bases and establish an interesting connection between maximally steerable assemblages and complete sets of mutually unbiased bases. We also provide a single steering inequality that can detect all bipartite pure states of full Schmidt rank. In the course of study, we generalize a number of results intimately connected to data-processing inequalities, which are of independent interest.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.006
metaresearch head score (Gemma)0.022
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.007
Threshold uncertainty score0.030

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0060.022
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0010.004
Scholarly communication0.0030.005
Open science0.0020.005
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0070.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.087
GPT teacher head0.397
Teacher spread0.310 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations64
Published2016
Admission routes2
Has abstractyes

Explore more

Same venuePhysical Review LettersSame topicNumerical methods in inverse problemsFrench-language works237,207