MétaCan
Menu
Back to cohort
Record W4382866785 · doi:10.1609/socs.v16i1.27309

Domain-Independent Dynamic Programming (Student Abstract)

2023· article· en· W4382866785 on OpenAlexaff
Ryo Kuroiwa

Bibliographic record

VenueProceedings of the International Symposium on Combinatorial Search · 2023
Typearticle
Languageen
FieldComputer Science
TopicConstraint Satisfaction and Optimization
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsFormalism (music)Computer scienceSolverDomain (mathematical analysis)Dynamic programmingProblem solverTheoretical computer scienceHeuristicProgramming languageMathematical optimizationAlgorithmArtificial intelligenceSoftware engineeringMathematics

Abstract

fetched live from OpenAlex

In my dissertation, I will propose Domain-Independent Dynamic Programming (DIDP), a novel model-based paradigm for combinatorial optimization (CO) based on dynamic programming (DP). In DIDP, a problem is first formulated as a declarative DP model and then solved by a general-purpose solver. The goal of my dissertation is to develop an algorithm-independent modeling formalism to define a DP model and general-purpose solvers for it and demonstrate that DIDP is promising for CO in practice. In particular, I will propose a modeling formalism based on a state transition system and heuristic search solvers for it.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.816
Threshold uncertainty score0.444

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0020.001
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.012
GPT teacher head0.276
Teacher spread0.264 · 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 teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
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

Citations0
Published2023
Admission routes1
Has abstractyes

Explore more

Same venueProceedings of the International Symposium on Combinatorial SearchSame topicConstraint Satisfaction and OptimizationFrench-language works237,207