Conference Information
ALT 2026: International Conference on Algorithmic Learning Theory
https://staging.algorithmiclearningtheory.org/
Submission Date:
2025-10-02
Notification Date:
2025-12-18
Conference Date:
2026-02-23
Location:
Toronto, Ontario, Canada
Years:
37
CCF: c   CORE: b   QUALIS: b1   Viewed: 42075   Tracked: 75   Attend: 24

Call For Papers
The 37th Algorithmic Learning Theory conference (ALT 2026) will be held in Toronto, Canada on February 23-26, 2026. The conference is dedicated to all theoretical and algorithmic aspects of machine learning. We invite submissions with contributions to new or existing learning problems including, but not limited to, the following list of topics.

    Design and analysis of learning algorithms.
    Classical foundations of learning theory: statistical, computational, algorithmic, and information-theoretic.
    Online learning and game theory.
    Optimization: convex, non-convex, new and old algorithms, their implicit biases, overparameterization, and so on.
    Different paradigms of learning: supervised, unsupervised, semi-supervised, active learning, reinforcement learning, and so on.
    All aspects of reinforcement learning: classical control-theoretic perspectives, modern uses such as LLM post-training, new algorithms, etc.
    Large language models, transformers, and all associated questions.
    Theoretical perspectives on trustworthy AI safety and AI safety: privacy, adaptive data analysis, fairness, alignment, and so on.
    Robustness: both classical perspectives (e.g. training data corruption), and modern perspectives (e.g. adversarial examples and LLM jailbreaks).
    Theoretical perspectives on deep learning: approximation, generalization, and optimization aspects of classical architectures such as shallow feedforward networks and simple RNNs, and modern architectures such as transformers.
    Core statistics topics: asymptotics, high-dimensional statistics, non-parametrics, causality, and so on.
    Learning with algebraic or combinatorial structure.
    Bayesian methods.
    Kernel methods. 
    Interpretability and explainability.
    Learning with algorithmic constraints: distributed learning, communication and memory efficient learning, federated learning, streaming algorithms, and so on.
    Different learning modalities: time series, sequence-to-sequence mappings, graph data, and so on.
    Mathematical analysis of sampling methods, including diffusion models and other practical methods.

Despite the theoretical focus of the conference, authors are welcome to support their analysis with relevant empirical results. Accepted papers will be presented at the conference as a full-length talk, and published electronically in the Proceedings of Machine Learning Research (PMLR); see details below and in the eventual submission instructions.
Last updated by Dou Sun in 2025-08-02
Acceptance Ratio
YearSubmittedAcceptedAccepted(%)
20211574629.3%
20201283829.7%
2019783747.4%
2018953334.7%
2017743344.6%
2008463167.4%
2007502550%
2006532445.3%
2005983030.6%
2004912931.9%
Related Conferences
CCFCOREQUALISShortFull NameSubmissionNotificationConference
IOTBCInternational Conference IOT, Blockchain and Cryptography2023-03-042023-03-092023-03-11
ICCIT'International Conference on Communications and Information Technology2014-05-312014-06-102014-07-21
ba*a2KRInternational Conference on the Principles of Knowledge Representation and Reasoning2025-05-072025-07-102025-11-11
cbb1SOUPSInternational Symposium On Usable Privacy and Security2025-02-132025-05-122025-08-10
CSNConference on Sensors and Networks2018-07-30 2018-11-28
FMVIPInternational Conference on Frontiers of Machine Vision and Image Processing2022-10-202022-11-052022-11-18
ICRCIEEE International Conference on Rebooting Computing2021-08-202021-10-112021-11-30
ICBB'International Congress on Biotechnology & Bioinformatics2022-07-10 2022-08-11
baa2CADEInternational Conference on Automated Deduction2017-02-112017-04-222017-08-06
RCVEInternational Conference on Robotics, Control and Vision Engineering2025-05-012025-05-152025-06-01
Recommendation