MétaCan
Menu
Back to cohort
Record W7132888887

Generalizable Machine Learning for Mathematical Optimizations

2023· dissertation· W7132888887 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

VenueTSpace · 2023
Typedissertation
Language
FieldComputer Science
TopicAdvanced Multi-Objective Optimization Algorithms
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsGeneralizationComputational learning theoryAlgorithmic learning theoryField (mathematics)Mathematical modelExploitMathematical structureOnline machine learningBlack box
DOInot available

Abstract

fetched live from OpenAlex

With machine learning gaining increasing popularity in recent years, most successes from employing machine learning methods are found in the fields where the problem solving relies heavily on pattern recognition and representation learning, with solutions consisting of sophisticated rules and logic that cannot be expressed by concise mathematical descriptions. Such fields of study include computer vision, natural language processing, molecular biology, and so on. On the other hand, in the field of mathematical optimization, the common nature of the problems is drastically different: each optimization problem is entirely formulated by highly abstract closed-form mathematical concepts. Therefore, machine learning is seemingly unfit for being a universal tool to mathematical optimizations. While there have been attempts on using machine learning for mathematical optimizations, the majority of the solutions developed in the literature are essentially problem-specific black box models learning existing input-to-solution mappings via brute force data-fitting. Furthermore, many such works only exploit machine learning as computationally faster alternatives or complementary pieces to the conventional mathematical algorithms. In this dissertation, we propose novel and generalizable machine learning approaches, each of which effectively solves a class of mathematical optimization problems, with benefits beyond just having faster or complementary computations. Specifically, we elaborate on three research projects along this direction: the uncertainty injection approach for robust optimizations; the transfer learning with reconstruction loss approach for solving correlated optimization tasks sharing the same input distribution; and the generalization of optimal control and reinforcement learning for non-cumulative objectives, where the proposed generalizations are over both the problem formulations and the corresponding algorithms. Throughout this dissertation, each of the proposed machine learning approaches is designed to be generalizable, flexible, and not restricted to any specific problem or application setting. Each approach serves more than just being a substitution to any existing mathematical optimization algorithm. We hope this dissertation is able to unveil the true potential of machine learning for being an imperative option when it comes to tackling general mathematical optimization problems.

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.002
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Science and technology studies
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.288
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.002
Science and technology studies0.0010.000
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.041
GPT teacher head0.368
Teacher spread0.327 · 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