Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

count% of corpus
0111 · Jun 202419922001200920172026
1 result for “branch-and-bound-and-cut”
ExDAG: an MIQP Algorithm for Learning DAGscs.LG

ExDAG solves DAG learning problems with low structural Hamming distance.

problem Learning DAGs with low structural Hamming distance under identifiability assumptions.
method Mixed-integer quadratic programming (MIQP) with branch-and-bound-and-cut algorithm and lazy constraints.
result ExDAG guarantees global convergence and provides a real-time quality assessment.
DAG learningMIQPbranch-and-bound-and-cutlazy constraintsstructural Hamming distance
2024-06-21abs ↗pdf ↗