StarAI 2018

Eighth International Workshop on Statistical Relational AI

The purpose of the Statistical Relational AI (StarAI) workshop is to bring together researchers and practitioners from two fields: logical (or relational) AI and probabilistic (or statistical) AI. These fields share many key features and often solve similar problems and tasks. Until recently, however, research in them has progressed independently with little or no interaction. The fields often use different terminology for the same concepts and, as a result, keeping-up and understanding the results in the other field is cumbersome, thus slowing down research. Our long term goal is to change this by achieving a synergy between logical and statistical AI. As a stepping stone towards realizing this big picture view on AI, we are organizing the Eighth International Workshop on Statistical Relational AI at the 27th International Joint Conference on Artificial Intelligence (IJCAI) in Stockholm, on July 14th 2018.

Practical

Format

StarAI will be a one day workshop with short paper presentations, a poster session, and three invited speakers.

  • Emma Brunskill (Stanford) 
  • Carla Gomes (Cornell) 
  • Sriraam Natarajan (UT Dallas) 

Submissions

Authors should submit either a full paper reporting on novel technical contributions or work in progress (AAAI style, up to 7 pages excluding references), a short position paper (AAAI style, up to 2 pages excluding references), or an already published work (verbatim, no page limit, citing original work) in PDF format via EasyChair. All submitted papers will be carefully peer-reviewed by multiple reviewers and low-quality or off-topic papers will be rejected. Accepted papers will be presented as a short talk and poster.

Important Dates

  • Paper Submission: May 22 May 23 (any timezone)
  • Notification of Acceptance: June 15
  • Camera-Ready Papers: July 2
  • Date of Workshop: July 14

Schedule

Morning

  •  8:30 a.m.: Welcome and introduction
  •  8:35 a.m.: Invited talk -- Emma Brunskill
    • Title: Leveraging Structure to Speed Learning to Make Good Decisions

      Abstract:Deep reinforcement learning has many exciting successes but people typically require much less experience to learn to make good decisions and obtain a high reward policy. We have been focusing on sample efficient methods for leveraging old data and strategic exploration methods to enable agents to quickly learn to make good decisions. In this talk I will describe some of our recent efforts in this space, including new work on perhaps the hardest Atari game, Pitfall.
      (slides)

  • 9:35 a.m.: Poster Spotlights (3 minutes each)
  • 10:10 a.m.: Coffee break & Poster Session (#1-12)
  • 11:30 a.m.: Invited talk -- Sriraam Natarajan
    • Title: Human Aware Statistical Relational AI

      Abstract: StaRAI models combine the powerful formalisms of probability theory and first-order logic to handle uncertainty in large, complex problems. While they provide a very effective representation paradigm due to their succinctness and parameter sharing, efficient learning is a significant problem in these models. First, I will discuss state-of-the-art learning method based on boosting that is representation independent. Our results demonstrate that learning multiple weak models can lead to a dramatic improvement in accuracy and efficiency.
      One of the key attractive properties of StaRAI models is that they use a rich representation for modeling the domain that potentially allows for seam-less human interaction. However, in current StaRAI research, the human is restricted to either being a mere labeler or being an oracle who provides the entire model. I will present our recent work that allows for more reasonable human interaction where the human input is taken as “advice” and the learning algorithm combines this advice with data. Finally, I will discuss our work on soliciting advice from humans as needed that allows for seamless interactions with the human expert.
      (slides)

  • 12:30 p.m.: Lunch break

Afternoon

  • 2:00 p.m.: Invited talk -- Carla Gomes
    • Title: Challenges for AI in Computational Sustainability and Scientific Discovery

      Abstract: Computational sustainability is a new interdisciplinary research field with the overarching goal of developing computational models, methods, and tools to help manage the balance between environmental, economic, and societal needs for a sustainable future. I will provide examples of computational sustainability problems, ranging from wildlife conservation and biodiversity, to poverty mitigation, to materials discovery for renewable energy materials. I will also highlight cross-cutting computational themes and challenges for AI at the intersection of constraint reasoning, optimization, machine learning, citizen science, and crowd-sourcing.
      (slides)

  • 3:00 p.m.: Poster Spotlights (3 minutes each)
  • 3:40 p.m.: Coffee break & Poster Session (#13-25)
  • 5:00 p.m.: Panel and wrapup

Accepted Papers

  1. Tanya Braun and Ralf Möller.
    Fusing First-order Knowledge Compilation and the Lifted Junction Tree Algorithm
  2. Marcel Gehrke, Tanya Braun and Ralf Möller.
    Preventing Unnecessary Groundings in the Lifted Dynamic Junction Tree Algorithm
  3. Fatemeh Riahi and Oliver Schulte.
    Model-based Exception Mining for Object-Relational Data
  4. Happy Mittal, Ayush Bhardwaj, Vibhav Gogate and Parag Singla.
    Domain Aware Markov Logic Networks
  5. Sebastijan Dumancic, Alberto Garcia-Duran and Mathias Niepert.
    On embeddings as an alternative paradigm for relational learning
  6. Brendan Juba.
    Polynomial-time probabilistic reasoning with partial observations via implicit learning in probability logics
  7. Nesreen Ahmed, Ryan Rossi, John Lee, Ted Willke, Rong Zhou, Xiangnan Kong and Hoda Eldardiry.
    Learning Role-based Graph Embeddings
  8. Rohan Chitnis, Leslie Kaelbling and Tomás Lozano-Pérez.
    Integrating Human-Provided Information Into Belief State Representation Using Dynamic Factorization
  9. Seyed Mehran Kazemi and David Poole.
    SimplE Embedding for Link Prediction in Knowledge Graphs
  10. Yuya Takashina, Shuyo Nakatani and Masato Inoue.
    Structure Learning of Markov Random Fields through Grow-Shrink Maximum Pseudolikelihood Estimation
  11. Bahare Fatemi, Seyed Mehran Kazemi and David Poole.
    Record Linkage to Match Customer Names: A Probabilistic Approach
  12. Marcel Gehrke, Tanya Braun and Ralf Möller.
    Answering Hindsight Queries with Lifted Dynamic Junction Trees
  13. Jiajun Pan, Hoel Le Capitaine and Philippe Leray.
    Relational constraints for metric learning on relational data
  14. Naoya Takeishi and Kosuke Akimoto.
    Knowledge-Based Distant Regularization in Learning Probabilistic Models
  15. Anna Latour, Behrouz Babaki and Siegfried Nijssen.
    Stochastic Constraint Optimization using Propagation on Ordered Binary Decision Diagrams
  16. Gagan Madan, Ankit Anand, Mausam and Parag Singla.
    Block Value Symmetries in Probabilistic Graphical Models
  17. Víctor Gutiérrez Basulto, Jean Christoph Jung and Ondřej Kuželka.
    Markov Logic Networks with Statistical Quantifiers
  18. Anh Tong and Jaesik Choi.
    Discovering Relational Covariance Structures for Explaining Multiple Time Series
  19. Varun Embar, Dhanya Sridhar, Golnoosh Farnadi and Lise Getoor.
    Scalable Structure Learning for Probabilistic Soft Logic
  20. Manfred Jaeger and Oliver Schulte.
    Inference, Learning, and Population Size: Projectivity for SRL Models
  21. Maarten Van den Heuvel, Wolfgang Gatterbauer, Martin Theobald and Floris Geerts.
    A General Framework for Anytime Approximation in Probabilistic Databases
  22. Vishal Sharma, Noman Sheikh, Happy Mittal, Vibhav Gogate and Parag Singla.
    Lifted Marginal MAP Inference
  23. Pedro Zuidberg Dos Martires, Anton Dries and Luc De Raedt.
    Knowledge Compilation with Continuous Random Variables and its Application in Hybrid Probabilistic Logic Programming
  24. Priyesh Vijayan, Yash Chandak, Mitesh Khapra and Balaraman Ravindran.
    HOPF: Higher Order Propagation Framework for Deep Collective Classification
  25. Aarthy Shivram Arun, Sai Vikneshwar Mani Jayaraman, Christopher Ré and Atri Rudra.
    Hypertree Decompositions Revisited for PGMs

Organization

Organizing Committee

For comments, queries and suggestions, please contact:
  • Angelika Kimmig (Cardiff) 
  • David Poole (UBC) 
  • Jay Pujara (USC) 
  • Parag Singla (IIT Delhi) 

Program Committee

  • Hendrik Blockeel (KU Leuven) 
  • Jaesik Choi (UNIST) 
  • Fabio Cozman (University of São Paulo)
  • Jesse Davis (KU Leuven)
  • Rodrigo de Salvo Braz (SRI International)
  • Pedro Domingos (University of Washington)
  • Sebastijan Dumancic (KU Leuven)
  • Richard Evans (Google DeepMind)
  • Manfred Jaeger (Aalborg University)
  • Mehran Kazemi (University of British Columbia)
  • Kristian Kersting (TU Darmstadt) 
  • Daniel Lowd (University of Oregon) 
  • Pasquale Minervini (University College London)
  • Sriraam Natarajan (The University of Texas at Dallas)
  • Aniruddh Nath (Google)
  • Maximilian Nickel (Facebook AI Research)
  • Mathias Niepert (NEC Labs)  
  • Scott Sanner (Oregon State University) 
  • Vitor Santos Costa (Universidade do Porto)
  • Oliver Schulte (Simon Fraser University)
  • Sameer Singh (University of California, Irvine) 
  • Dhanya Sridhar (UC Santa Cruz) 
  • Lucas Sterckx (Ghent)
  • Guy Van den Broeck (UCLA) 
  • Johannes Welbl (University College London) 

Topics

StarAI is currently provoking a lot of new research and has tremendous theoretical and practical implications. Theoretically, combining logic and probability in a unified representation and building general-purpose reasoning tools for it has been the dream of AI, dating back to the late 1980s. Practically, successful StarAI tools will enable new applications in several large, complex real-world domains including those involving big data, social networks, natural language processing, bioinformatics, the web, robotics and computer vision. Such domains are often characterized by rich relational structure and large amounts of uncertainty. Logic helps to effectively handle the former while probability helps her effectively manage the latter. We seek to invite researchers in all subfields of AI to attend the workshop and to explore together how to reach the goals imagined by the early AI pioneers.

The focus of the workshop will be on general-purpose representation, reasoning and learning tools for StarAI as well as practical applications. Specifically, the workshop will encourage active participation from researchers in the following communities: satisfiability (SAT), knowledge representation (KR), constraint satisfaction and programming (CP), (inductive) logic programming (LP and ILP), graphical models and probabilistic reasoning (UAI), statistical learning (NIPS, ICML, and AISTATS), graph mining (KDD and ECML PKDD) and probabilistic databases (VLDB and SIGMOD). It will also actively involve researchers from more applied communities, such as natural language processing (ACL and EMNLP), information retrieval (SIGIR, WWW and WSDM), vision (CVPR and ICCV), semantic web (ISWC and ESWC) and robotics (RSS and ICRA).

Previous Workshops

Previous StarAI workshops were held in conjunction with AAAI 2010, UAI 2012, AAAI 2013, AAAI 2014, UAI 2015, and IJCAI 2016, UAI 2017 and were among the most popular workshops at the conferences.