MétaCan
Menu
Back to cohort
Record W2074855022 · doi:10.1002/pamm.200700907

Hybrid symbolic‐numeric algorithms for computational convex analysis

2007· article· en· W2074855022 on OpenAlexaff
Yves Lucet

Bibliographic record

VenuePAMM · 2007
Typearticle
Languageen
FieldMathematics
TopicAdvanced Optimization Algorithms Research
Canadian institutionsOkanagan University CollegeUniversity of British Columbia, Okanagan Campus
Fundersnot available
KeywordsAlgorithmPiecewiseComputationQuadratic equationConvex conjugatePiecewise linear functionConvex optimizationComputer scienceOperator (biology)Regular polygonSymbolic data analysisConvex analysisSymbolic computationMathematicsMathematical optimizationTheoretical computer science

Abstract

fetched live from OpenAlex

Abstract Computational convex analysis focuses on developing efficient tools to compute fundamental transforms arising in convex analysis. Symbolic computation tools have been developed, and have allowed more insight into the calculation of the Fenchel conjugate and related transforms. When such tools are not applicable e.g. when there is no closed form, fast transform algorithms perform numerical computation efficiently. However, computing the composition of several transforms is difficult to achieve with fast transform algorithms, which is the case for the recently introduced proximal average operator. We consider the class of piecewise linear‐quadratic functions which, being closed under the most relevant operations in convex analysis, allows the robust and efficient numerical computation of compositions of transforms like the proximal average. The algorithms presented are hybrid symbolic‐numeric: they first compute a piecewise linear‐quadratic approximation of the function, and then manipulate the approximation symbolically. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

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.002
metaresearch head score (Gemma)0.005
Version: metacan-v3-hybrid-931329e0061cValidation 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: Empirical · Consensus signal: none
Teacher disagreement score0.007
Threshold uncertainty score0.024

Distilled classifier scores by category (both heads)

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

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.067
GPT teacher head0.412
Teacher spread0.345 · 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 designSimulation or modeling
Domainnot available
GenreEmpirical

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

Citations3
Published2007
Admission routes1
Has abstractyes

Explore more

Same venuePAMMSame topicAdvanced Optimization Algorithms ResearchFrench-language works237,207