Image Not Available

Stefano Ermon

Ph.D. Candidate
Department of Computer Science
344 Gates Hall
Cornell University
Ithaca, NY 14853

Email: ermonste AT cs.cornell.edu

About Me

I am currently a PhD candidate in the Department of Computer Science at Cornell University, working with Professor Carla Gomes and Professor Bart Selman. I received a B.Sc. (2006) and M.Sc. (2008) both in Electrical Engineering from the University of Padova.

NEWS: I've accepted a tenure-track assistant professor position in Computer Science at Stanford University.

Research Interests

Honors and Awards

[return]

Publications

Conference Papers (Refereed and Archived)

  1. Stefano Ermon, Carla Gomes, Ashish Sabharwal, and Bart Selman.
    Designing Fast Absorbing Markov Chains. [PDF]
    AAAI-14. In Proc. 28th AAAI Conference on Artificial Intelligence , July 2014.
  2. Stefano Ermon, Carla Gomes, Ashish Sabharwal, and Bart Selman.
    Low-density Parity Constraints for Hashing-Based Discrete Integration. [PDF]
    ICML-14. In Proc. 31st International Conference on Machine Learning, June 2014.
  3. Stefano Ermon, Carla Gomes, Ashish Sabharwal, and Bart Selman.
    Embed and Project: Discrete Sampling with Universal Hashing. [PDF]
    NIPS-13. In Proc. 27th Annual Conference on Neural Information Processing Systems, December 2013.
  4. Stefano Ermon, Carla Gomes, Ashish Sabharwal, and Bart Selman.
    Optimization With Parity Constraints: From Binary Codes to Discrete Integration. [PDF] [Slides] [Poster]
    UAI-13. In Proc. 29th Conference on Uncertainty in Artificial Intelligence, July 2013.
    [Oral presentation, acceptance rate: 26/233 (11%)]
    Best student paper award.
    Best paper award runner-up.
  5. Stefano Ermon, Carla Gomes, Ashish Sabharwal, and Bart Selman.
    Taming the Curse of Dimensionality: Discrete Integration by Hashing and Optimization. [PDF] [Slides]
    ICML-13. In Proc. 30th International Conference on Machine Learning, June 2013.
    [Full oral presentation, acceptance rate 143/1204 (12%)]
  6. Stefano Ermon, Carla Gomes, Ashish Sabharwal, and Bart Selman.
    Density Propagation and Improved Bounds on the Partition Function. [PDF] [Poster]
    NIPS-12. In Proc. 26th Annual Conference on Neural Information Processing Systems, December 2012.
    [Full paper, acceptance rate: 370/1467 (25%)]
  7. Stefano Ermon, Carla Gomes, and Bart Selman.
    Uniform Solution Sampling Using a Constraint Solver As an Oracle. [PDF] [Slides]
    UAI-12. In Proc. 28th Conference on Uncertainty in Artificial Intelligence, August 2012.
    [Oral presentation, acceptance rate: 24/304 (8%)]
  8. Liaoruo Wang, Stefano Ermon, and John Hopcroft.
    Feature-Enhanced Probabilistic Models for Diffusion Network Inference. [PDF] [Slides]
    ECML-PKDD-12. In Proc. of European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, September 2012.
    [Full paper, acceptance rate: 105/443 (24%)]
  9. Stefano Ermon, Yexiang Xue, Carla Gomes, and Bart Selman.
    Learning Policies For Battery Usage Optimization in Electric Vehicles. [PDF] [Slides]
    ECML-PKDD-12. In Proc. of European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, September 2012.
    [Full paper, acceptance rate: 105/443 (24%)]
  10. Stefano Ermon, Ronan Le Bras, Carla Gomes, Bart Selman, and Bruce van Dover.
    SMT-Aided Combinatorial Materials Discovery. [PDF]
    SAT-12. In Proc. 15th International Conference on Theory and Applications of Satisfiability Testing, June 2012.
    [Full paper, acceptance rate: 29/88 (33%)]
  11. Stefano Ermon, Carla Gomes, Bart Selman, and Alexander Vladimirsky.
    Probabilistic Planning With Non-linear Utility Functions and Worst Case Guarantees. [PDF]
    AAMAS-12. In Proc. 11th International Conference on Autonomous Agents and Multiagent Systems, June 2012.
    [Full paper, acceptance rate: 137/671 (20.5%)]
  12. Stefano Ermon, Carla Gomes, Ashish Sabharwal, and Bart Selman.
    Accelerated Adaptive Markov Chain for Partition Function Computation. [PDF]
    NIPS-11. In Proc. 25th Annual Conference on Neural Information Processing Systems, December 2011.
    [Spotlight presentation, acceptance rate: 66/1400 (4.7%)]
  13. Stefano Ermon, Carla Gomes, and Bart Selman.
    A Flat Histogram Method for Computing the Density of States of Combinatorial Problems. [PDF] [Video]
    IJCAI-11. In Proc. 22nd International Joint Conference on Artificial Intelligence, July 2011. Invited paper.
  14. Stefano Ermon, Jon Conrad, Carla Gomes, and Bart Selman.
    Risk-Sensitive Policies for Sustainable Renewable Resource Allocation. [PDF] [Video]
    IJCAI-11. In Proc. 22nd International Joint Conference on Artificial Intelligence, July 2011.
    [Oral presentation, acceptance rate: 227/1325 (17%)]
  15. Stefano Ermon, Carla Gomes, and Bart Selman.
    A Message Passing Approach to Multiagent Gaussian Inference for Dynamic Processes (Short Paper). [PDF]
    AAMAS-11. In Proc. 10th International Conference on Autonomous Agents and Multiagent Systems, May 2011.
  16. Stefano Ermon, Carla Gomes, and Bart Selman. Computing the Density of States of Boolean Formulas. [PDF] [Slides]
    CP-10. In Proc. 16th International Conference on Principles and Practice of Constraint Programming, September 2010.
    Best student paper award.
  17. Stefano Ermon, Jon Conrad, Carla Gomes, and Bart Selman.
    Playing Games against Nature: Optimal Policies for Renewable Resource Allocation. [PDF]
    UAI-10. In Proc. 26th Conference on Uncertainty in Artificial Intelligence, July 2010.
    [Plenary oral presentation, acceptance rate: 30/260 (11.5%)]
    (also presented at the 2nd International Conference on Computational Sustainability, June 2010, the 1st DIMACS
    Workshop on Conservation Biology    , July 2010, and the 3rd International Workshop on Constraint Reasoning and
    Optimization for Computational Sustainability    , September 2010)
  18. Stefano Ermon, Carla Gomes, and Bart Selman.
    Collaborative Multiagent Gaussian Inference in a Dynamic Environment Using Belief Propagation (Short Paper). [PDF]
    AAMAS-10. In Proc. 9th International Conference on Autonomous Agents and Multiagent Systems, May 2010.
  19. Stefano Ermon, Luca Schenato, and Sandro Zampieri. [PDF]
    Trust Estimation in Autonomic Networks: a Statistical Mechanics Approach.
    CDC-09. In Proc. 48th IEEE Conference on Decision and Control (CDC), December 2009.

Journal Articles

  1. Stefano Ermon, Yexiang Xue, Carla Gomes, and Bart Selman.
    Learning Policies For Battery Usage Optimization in Electric Vehicles.
    In Machine Learning: Volume 92, Issue 1 (2013), Page 177-194 , 2013

Workshop Papers and Other Work

  1. Stefano Ermon, Carla Gomes, Ashish Sabharwal, and Bart Selman.
    Discrete Integration by Decoding Binary Codes.
    INFERNING-13. To appear.
  2. Stefano Ermon, Yexiang Xue, Carla Gomes, and Bart Selman. Combinatorial Decision Making in Complex, Uncertain, and Highly Dynamic Environments.
    COMPSUST-12. In Third International Conference on Computational Sustainability, July 2012.
  3. Stefano Ermon, Eoin O'Mahony, and Carla Gomes. Towards Probabilistic Contact Network Discovery.
    MLSUST-11. In NIPS Workshop on Machine Learning for Sustainability, December 2011.
  4. Stefano Ermon, Carla Gomes, Ashish Sabharwal, and Bart Selman.
    A Flat Histogram Method for Inference with Probabilistic and Deterministic Constraints. [PDF]
    DISCML-10. In NIPS Workshop on Monte Carlo Methods for Modern Applications and NIPS Workshop on
    Discrete Optimization in Machine Learning: Structures, Algorithms and Applications    , December 2010.
  5. Stefano Ermon. Trust Estimation in Autonomic Networks: a Message Passing Approach. [PDF]
    NECSYS-09. In Proc. 1st IFAC Workshop on Estimation and Control of Networked Systems, September 2009.
  6. Stefano Ermon. Optimal Control Techniques for Virtual Memory Management. [PDF]
    M.S. Thesis, University of Padova, July 2008. Advisor: Professor Gianfranco Bilardi.

[return]

Professional Service

[return]

Recent Invited Talks

[return]

Software and Benchmarks

WISH
WISH is a general algorithm to approximate (with high probability and within any desired degree of accuracy) discrete weighted sums defined over exponentially large sets of items. This implementation is specifically designed to approximate the partition function (normalization constant) of discrete probabilistic graphical models, by (approximately) solving a small number of optimization instances (maximum likelihood queries) using a combinatorial optimization package.
  • Binaries (Linux, 64 bit) of WISH version 1.0 (source code coming soon) [ICML 2013]
  • Instances used to evaluate the WISH algorithm [ICML 2013]
        
MoNet
MoNet is an algorithm to infer latent network structure based on observations of textual "cascades" spreading over the network. For example, MoNet can be used to infer a following relationship (who is following whom) on Twitter by observing sequences of tweets. It first defines a probabilistic model that specifically takes into account time and textual information of the messages, and then infers the most likely underying network structure by solving a sequence of convex optimization problems.
  • MoNet source code for inferring latent network structure based on textual cascades [ECML-PKDD 2012]
        
      

Combinatorial Materials Discovery Benchmark Instances
In combinatorial materials discovery, materials scientists search for new materials with desirable physical properties by obtaining x-ray diffraction measurements on hundreds of samples from a composition spread. We integrated domain-specific scientific background knowledge about the physical and chemical properties of the materials into a Satisfiability Modulo Theories (SMT) reasoning framework based on linear arithmetic. Using a novel encoding, state-of-the-art SMT solvers can automatically analyze large synthetic datasets, and generate interpretations that are physically meaningful and very accurate, even in the presence of noise.
  • SMT instances (SMTLib Version 2.0) for the phase map identification of the Al-Li-Fe synthetic system [SAT 2012]
        

Search Tree Sampler
SearchTreeSampler is a sampling technique that, while enforcing an approximately uniform exploration of the search space, leverages the reasoning power of a systematic constraint solver in a black-box scheme. They key idea is to explore the search tree uniformly in a breadth-first way, subsampling a subset of representative nodes at each level. The number of nodes kept at each level is a parameter used to trade off uniformity with computational complexity. The samples provided by STS can then be used to estimate the number of solutions of the problem (partition function).
  • Source code of Search Tree Sampler (with MiniSAT as an NP-oracle). [UAI 2012]
        

Energy Demand in Commuter Trips Dataset
We produced a dataset of energy demand profiles for commuter trips acros the US by processing the raw data originally collected by the ChargeCar project at CMU. We used this dataset to train an intelligent energy management system for electric vehicles, based on a combination of optimization, MDPs, and supervised learning techniques. The new approach significantly outperforms the leading algorithms that were previously proposed as part of an open algorithmic challenge.
  • Dataset of crowdsourced commuter trips acroos the US (generated processing the raw data originally collected by ChargeCar) [ECML 2012]
        

Flat Histogram Sampling Code
We investigated the use of advanced flat histogram sampling techniques from statistical physics to explore large combinatorial spaces. This is a class of adaptive MCMC (Markov Chain Monte Carlo) methods that can adapt transition probabilities based on the chain history. Intuitively, this allows the chain to escape from local minima, which can be very helpful for difficult energy landscapes. Further, we introduced a focused component (inspired by local search combinatorial optimization) that can leverage problem structure and speed up convergence. 		       
Educational Software
Free program I developed with help of M.D. friends to assist in the preparation of the Italian Medical Licensing Natioanl Exam. Users can practice with a user-friendly GUI and over 6,000 multiple-choice questions, and focus on the most challenging subjects based on statistics collected by the program. 		       
               

[return]

Teaching Experience

[return]

Other Interests

Soccer
I like to play soccer and luckily there are many opportunities to play in Ithaca. In the picture our team photo after winning the 2009 Cornell Outdoor Soccer Intramurals. 		       
Ice Hockey
After moving to Ithaca, I picked up ice hockey. Our CS Department has a long standing tradition of organizing (and sponsoring) friendly pick-up hockey games at the local ice rink. In the picture a somewhat outdated group photo taken before a game at Lynah Rink. 		       
Hiking
I was lucky to grow up in a beatiful region in the middle of the Italian Alps, and thanks to my parents I've enjoyed many beautiful hikes since I was little. In the picture me and my dog resting in the grass with the beautiful Odle on the background. 		       

[return]


Locations of visitors to this page

©2011 Stefano Ermon