MétaCan
Menu
Back to cohort
Record W3016792721 · doi:10.1553/etna_vol52s214

ADMM-Softmax: an ADMM approach for multinomial logistic regression. ETNA - Electronic Transactions on Numerical Analysis

2020· article· en· W3016792721 on OpenAlexaff
Eldad Haber, Lars Ruthotto, Sanna Tyrväinen

Bibliographic record

VenueOesterreichisches Musiklexikon online (Institut für kunst- und musikhistorische Forschungen der Österreichischen Akademie der Wissenschaften) · 2020
Typearticle
Languageen
FieldEngineering
TopicSparse and Compressive Sensing Techniques
Canadian institutionsUniversity of British Columbia
FundersDivision of Mathematical SciencesNational Science Foundation
KeywordsSoftmax functionMultinomial logistic regressionMathematicsStochastic gradient descentConvex optimizationMathematical optimizationPreconditionerGeneralizationAlgorithmComputer scienceApplied mathematicsRegular polygonArtificial intelligenceIterative methodStatisticsDeep learning

Abstract

fetched live from OpenAlex

We present ADMM-Softmax, an alternating direction method of multipliers (ADMM) for solving multinomial logistic regression (MLR) problems. Our method is geared toward supervised classification tasks with many examples and features. It decouples the nonlinear optimization problem in MLR into three steps that can be solved efficiently. In particular, each iteration of ADMM-Softmax consists of a linear least-squares problem, a set of independent small-scale smooth, convex problems, and a trivial dual variable update. The solution of the least-squares problem can be accelerated by pre-computing a factorization or preconditioner, and the separability in the smooth, convex problem can be easily parallelized across examples. For two image classification problems, we demonstrate that ADMM-Softmax leads to improved generalization compared to a Newton-Krylov, a quasi Newton, and a stochastic gradient descent method.

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 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 categoriesMeta-epidemiology (narrow), Research integrity
Consensus categoriesMeta-epidemiology (narrow), Research integrity
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.820
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0020.002
Meta-epidemiology (broad)0.0030.002
Bibliometrics0.0010.002
Science and technology studies0.0010.000
Scholarly communication0.0000.001
Open science0.0020.000
Research integrity0.0010.003
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.057
GPT teacher head0.317
Teacher spread0.260 · 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; both teacher heads agree on what is shown here.

Study designSimulation or modeling
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

Citations14
Published2020
Admission routes1
Has abstractyes

Explore more

Same venueOesterreichisches Musiklexikon online (Institut für kunst- und musikhistorische Forschungen der Österreichischen Akademie der Wissenschaften)Same topicSparse and Compressive Sensing TechniquesFrench-language works237,207