← Authors

Bistra Dilkina

27 papers · 2017–2025 · 7 conferences · across top CS/AI conferences

Achievements

🧭 Keyword Pioneer 🌈 Renaissance Researcher (9) πŸ—ΊοΈ Taxonomy Completionist (56) πŸƒ Academic Marathon (8) 🐝 Cross-Pollinator (15) 🐣 Hot Topic Early Bird πŸŒ‰ Interdisciplinary Bridge 🌍 Conference Polyglot (7) πŸ† Keyword Champion (3) πŸ† Grand Slam πŸ—ƒοΈ Keyword Collector (120) πŸš€ Conference Pioneer πŸ’Ž Century Club (27) πŸ”₯ Unstoppable (9) ⚑ Prolific Year (7)

Conferences

AAAI (10) ICML (6) IJCAI (4) NIPS (4) CVPR (1) ICLR (1) WACV (1)

Top co-authors

Taoan Huang (8) Milind Tambe (7) Yuandong Tian (5) Aaron M Ferber (5) Bryan Wilder (4) Arman Zharmagambetov (3) Sven Koenig (3) Elias B. Khalil (2) Aaron Ferber (2) Amrita Gupta (2)

Keywords

combinatorial optimization (9) large neighborhood search (5) mixed integer programming (3) multi-agent path finding (3) decision-focused learning (3) integer linear program (2) end-to-end learning (2) land cover mapping (2) multi-armed bandit (2) contrastive learning (2) anytime algorithm (2) representation learning (2) semantic segmentation (2) deep learning (2) remote sensing (2) integer programming (2) surrogate model (2) branch and bound (2) domain adaptation (2) neural network (2)

Papers

Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problems IJCAI 2025
Contrastive Predict-and-Search for Mixed Integer Linear Programs ICML 2024
Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood Search AAAI 2024
Position: Application-Driven Innovation in Machine Learning ICML 2024
GenCO: Generating Diverse Designs with Combinatorial Constraints ICML 2024
Landscape Surrogate: Learning Decision Losses for Mathematical Optimization Under Partial Information NIPS 2023
Moccasin: Efficient Tensor Rematerialization for Neural Networks ICML 2023
SurCo: Learning Linear SURrogates for COmbinatorial Nonlinear Optimization Problems ICML 2023
Searching Large Neighborhoods for Integer Linear Programs with Contrastive Learning ICML 2023
Finding Backdoors to Integer Programs: A Monte Carlo Tree Search Framework AAAI 2022
Anytime Multi-Agent Path Finding via Machine Learning-Guided Large Neighborhood Search AAAI 2022
Controllable Guarantees for Fair Outcomes via Contrastive Information Estimation AAAI 2021
Learning to Resolve Conflicts for Multi-Agent Path Finding with Conflict-Based Search AAAI 2021
BIRDSAI: A Dataset for Detection and Tracking in Aerial Thermal Infrared Videos WACV 2020
A General Large Neighborhood Search Framework for Solving Integer Linear Programs NIPS 2020
To Signal or Not To Signal: Exploiting Uncertain Real-Time Information in Signaling Games for Security and Sustainability AAAI 2020
End-to-End Game-Focused Learning of Adversary Behavior in Security Games AAAI 2020
MIPaaL: Mixed Integer Program as a Layer AAAI 2020
Human-Machine Collaboration for Fast Land Cover Mapping AAAI 2020
Embedding Conjugate Gradient in Learning Random Walks for Landscape Connectivity Modeling in Conservation IJCAI 2020
End to end learning and optimization on graphs NIPS 2019
Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization AAAI 2019
Combinatorial Attacks on Binarized Neural Networks ICLR 2019
Large Scale High-Resolution Land Cover Mapping With Multi-Resolution Data CVPR 2019
Discrete Interventions in Hawkes Processes with Applications in Invasive Species Management IJCAI 2018
Learning Combinatorial Optimization Algorithms over Graphs NIPS 2017
Learning to Run Heuristics in Tree Search IJCAI 2017