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

3 results for “B-Trees”

Learning from Data to Speed-up Sorted Table Search Procedures: Methodology and Practical Guidelinescs.LG

Machine learning speeds up search procedures for sorted tables.

problem Improving the speed of sorted table search procedures.

method Systematic experimental comparison of efficient implementations with learned counterparts.

result Learned data structures can significantly speed up search procedures.

Machine Learning Sorted Table Search Data Structures B-Trees Hash Tables

2020-07-20abs ↗pdf ↗

Lookback for Learning to Branchcs.LG

Graph Neural Networks learn to mimic strong branching in MILP solvers.

problem Improving variable selection in MILP solvers using Graph Neural Networks.

method Proposed methods include target smoothing and a Parent-as-Target Lookback regularizer.

result Up to 22% decrease in B&B tree size and 15% improvement in solving times.

Graph Neural Networks MILP Solvers Branching Heuristics Lookback Phenomenon Variable Selection

2022-06-30abs ↗pdf ↗

Parameterizing Branch-and-Bound Search Trees to Learn Branching Policiescs.LG

New method learns better branching policies for MILP problems.

problem Improving branch and bound search for solving MILP problems.

method Imitates strong branching rule with parameterized state of B&B search tree.

result Generalized policies outperform current state-of-the-art.

MILP Branch and Bound Imitation Learning Branching Policies Parameterization

2020-02-12abs ↗pdf ↗