GroundedML: Workshop on Anchoring Machine Learning in Classical Algorithmic Theory

A special issue of Algorithms (ISSN 1999-4893).

Deadline for manuscript submissions: closed (31 August 2022) | Viewed by 251

Special Issue Editors


E-Mail Website
Guest Editor
Samsung AI Center, Montreal, QC, Canada
Interests: learning from graph-like data; relational reasoning; causal discovery

E-Mail Website
Guest Editor
ServiceNow Research, Montreal, QC, Canada
Interests: Machine learning; graphs; stochastic processes

E-Mail Website
Guest Editor
ServiceNow Research, Montreal, QC, Canada
Interests: Artificial Intelligence; Computer Vision; Deep Learning; Low Data Learning; NLP
HEC Montreal, Montreal Institute for Learning Alogorithms (MILA), Montreal, QC, Canada
Interests: deep learning, reinforcement learning; graph representation learning and reasoning; recommender systems; natural language understanding; drug discovery

E-Mail Website
Guest Editor
Department of Computer Science, National University of Singapore, Singapore, Singapore
Interests: graph neural networks; spectral graph theory; computer vision; natural language processing; quantum chemistry; combinatorial optimization

Special Issue Information

Dear Colleagues,

Recent advances in machine learning (ML) have revolutionized our ability to solve complex problems in a myriad of application domains, yet just as empirical data play a fundamental role in the development of such applications, the process of designing these methods has also remained empirical: we have learned which of the known methods tend to perform better for certain types of problems and have developed an intuition guiding our discovery of new methods.

In contrast, classical algorithmic theory provides tools directly addressing the mathematical core of a problem, and clear theoretical justifications motivate powerful design techniques. At the heart of this process is the analysis of the correctness and time/space efficiency of an algorithm, providing actionable bounds and guarantees. Problems themselves may be characterized by bounding the performance of any algorithm, providing a meaningful reference point to which concrete algorithms may be compared. While ML models may appear to be an awkward fit for such techniques, some research in the area has succeeded in obtaining results with the “definitive” flavor associated with algorithms, complementary to empirical ones. Are such discoveries bound to be exceptions, or can they be part of a new algorithmic theory?

The GoundedML workshop seeks to bring together researchers from both the algorithmic theory and machine learning communities, starting a dialogue on how ideas from theoretical algorithm design can inspire and guide future research in ML.

Topics for submissions include but are not limited to:

* Frameworks for algorithmic guarantees and time complexity bounds of ML models;

* Study of inherent complexity class of ML problems and bounds on learning capacity of certain model design paradigms;

* Develop methods for designing algorithms from problem specifications (e.g., dynamic programming) and techniques for algorithmic alignment, modularity, and compositionality of ML models.

For more information, please refer to https://sites.google.com/view/groundedml2022

Dr. Perouz Taslakian
Dr. ‪Pierre-André Noël‬
Dr. David Vázquez
Dr. Jian Tang
Prof. Dr. Xavier Bresson
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.

Further information on MDPI's Special Issue polices can be found here.

Published Papers

There is no accepted submissions to this special issue at this moment.
Back to TopTop