← Search

HARIPRASAD KODAMANA

4 accepted papers

2026

MIRACLE: Model-free Imitation and Reinforcement Learning for Adaptive Cut-Selection

ICLR 2026poster

Mixed-Integer Programming (MIP) solvers rely heavily on cutting planes to tighten LP relaxations, but traditional approaches generate thousands of cuts that consume gigabytes of memory while providing minimal benefit. We present an intelligent cut selection framework that achieves a 98.1\% reduction…

Cited by 0SourceScholar
2026

Position: Graph Condensation Needs a Reset—Move Beyond Full-dataset Training and Model-Dependence

ICML 2026spotlight

Graph Neural Networks (GNNs) are powerful tools for learning from graph-structured data, but their scalability is increasingly strained by the size of real-world graphs in domains like recommender systems, fraud detection, and molecular biology. Graph condensation—the task of generating a smaller sy…

Cited by 0SourceScholar
2025

Bonsai: Gradient-free Graph Condensation for Node Classification

ICLR 2025poster

Graph condensation has emerged as a promising avenue to enable scalable training of GNNs by compressing the training dataset while preserving essential graph characteristics. Our study uncovers significant shortcomings in current graph condensation techniques. First, the majority of the algorithms p…

Cited by 0SourcePDFScholar
2024

Mirage: Model-agnostic Graph Distillation for Graph Classification

ICLR 2024poster

GNNs, like other deep learning models, are data and computation hungry. There is a pressing need to scale training of GNNs on large datasets to enable their usage on low-resource environments. Graph distillation is an effort in that direction with the aim to construct a smaller synthetic training se…