MIT Open Scholarship
metadata only
Optimization in Machine Learning: Decision Trees, Sparse Linear Models and LLM Pruning
This thesis develops optimization algorithms for three families of discrete optimization problems arising in machine learning and statistics: building decision trees, large language model pruning, and sparse regression. Depending on the problem structure and scale, we exploit problem structure to de
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Fairness of Classifiers in the Presence of Constraints between Features#151752
- Abstract computation over first-order structures. Extras: From programs to decision trees I#658996
- Abstract computation over first-order structures. Extras: From programs to decision trees I#656860
- The Complexity of Recognizing SDP Exactness for the Maximum Cut Problem#1123200
- A tight 1/3-approximation algorithm and fully polynomial-time approximation schemes for the Colored Knapsack Problem#1011438
Record · ID 923193
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive