← Search

Milad Hashemi

10 accepted papers

2026

SWE-fficiency: Can Language Models Optimize Real-World Repositories on Real Workloads?

ICML 2026poster

Optimizing the performance of large-scale software repositories demands expertise in code reasoning and software engineering (SWE) to reduce runtime while preserving program correctness. However, most benchmarks emphasize what to fix rather than how to fix code. We introduce SWE-fficiency, a benchma…

Cited by 0SourceScholar
2024

Learning Performance-Improving Code Edits

ICLR 2024spotlight

With the decline of Moore's law, optimizing program performance has become a major focus of software research. However, high-level optimizations such as API and algorithm changes remain elusive due to the difficulty of understanding the semantics of code. Simultaneously, pretrained large language mo…

2023

CUF: Continuous Upsampling Filters

CVPR 2023poster

Neural fields have rapidly been adopted for representing 3D signals, but their application to more classical 2D image-processing has been relatively limited. In this paper, we consider one of the most important operations in image processing: upsampling. In deep learning, learnable upsampling layers…

Cited by 11SourcePDFScholar
2022

Data-Driven Offline Optimization for Architecting Hardware Accelerators

ICLR 2022poster

To attain higher efficiency, the industry has gradually reformed towards application-specific hardware accelerators. While such a paradigm shift is already starting to show promising results, designers need to spend considerable manual effort and perform large number of time-consuming simulations to…

2021

No MCMC for me: Amortized sampling for fast and stable training of energy-based models

ICLR 2021poster

Energy-Based Models (EBMs) present a flexible and appealing way to represent uncertainty. Despite recent advances, training EBMs on high-dimensional data remains a challenging problem as the state-of-the-art approaches are costly, unstable, and require considerable tuning and domain expertise to app…

2021

Oops I Took A Gradient: Scalable Sampling for Discrete Distributions

ICML 2021oral

We propose a general and scalable approximate sampling strategy for probabilistic models with discrete variables. Our approach uses gradients of the likelihood function with respect to its discrete inputs to propose updates in a Metropolis-Hastings sampler. We show empirically that this approach out…

2020

An Imitation Learning Approach for Cache Replacement

ICML 2020poster

Program execution speed critically depends on increasing cache hits, as cache hits are orders of magnitude faster than misses. To increase cache hits, we focus on the problem of cache replacement: choosing which cache line to evict upon inserting a new line. This is challenging because it requires p…

2020

LEARNING EXECUTION THROUGH NEURAL CODE FUSION

ICLR 2020poster

As the performance of computer systems stagnates due to the end of Moore’s Law, there is a need for new models that can understand and optimize the execution of general purpose code. While there is a growing body of work on using Graph Neural Networks (GNNs) to learn static representations of source…

Cited by 37SourceScholar
2020

Neural Execution Engines: Learning to Execute Subroutines

NeurIPS 2020poster

A significant effort has been made to train neural networks that replicate algorithmic reasoning, but they often fail to learn the abstract concepts underlying these algorithms. This is evidenced by their inability to generalize to data distributions that are outside of their restricted training set…

2018

Learning Memory Access Patterns

ICML 2018oral

The explosion in workload complexity and the recent slow-down in Moore’s law scaling call for new approaches towards efficient computing. Researchers are now beginning to use recent advances in machine learning in software optimizations; augmenting or replacing traditional heuristics and data struct…

Cited by 278SourcePDFScholar