MétaCan
Menu
Back to cohort
Record W2128286686 · doi:10.1137/s105262340343470x

Tail Decay and Moment Estimates of a Condition Number for Random Linear Conic Systems

2005· article· en· W2128286686 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueSIAM Journal on Optimization · 2005
Typearticle
Languageen
FieldMathematics
TopicMarkov Chains and Monte Carlo Methods
Canadian institutionsToronto Metropolitan University
FundersEngineering and Physical Sciences Research CouncilNuffield FoundationCity University of Hong Kong
KeywordsMathematicsConic sectionCombinatoricsMoment (physics)Distribution (mathematics)GaussianUpper and lower boundsSecond moment of areaMathematical analysisGeometryPhysics

Abstract

fetched live from OpenAlex

In this paper we study the distribution of $\mathscr C(A)$ and $\log\mathscr C(A)$, where $\mathscr C(A)$ is a condition number for the linear conic system $Ax\leq 0$, $x\neq 0$, with $A\in\Bbb R^{n\times m}$. For Gaussian matrices A we develop both upper and lower bounds on the decay rates of the distribution tails of $\mathscr C(A)$, showing that ${\bf P}\left[\mathscr C(A)\geq t\right]\sim c/t$ for large t, where c is a factor that depends only on the problem dimensions $(m,n)$. Using these bounds, we derive moment estimates for $\mathscr C(A)$ and $\log\mathscr C(A)$ and prove various limit theorems for the cases where m and/or n are large. Combined with condition number based complexity analyses, our results yield tail information on the distribution of running times for interior-point or relaxation methods designed to solve the feasibility problem $Ax\leq 0$, $x\neq 0$.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.249
Threshold uncertainty score0.388

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.038
GPT teacher head0.361
Teacher spread0.323 · 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