Research map / Learning theory and algorithms / Prediction and decision losses

Convergence Analysis of Tsetlin Machines under Noise-Free and Noisy Training Conditions: from $2$ Bits to $k$ Bits

ICLR 2026 · Learning theory and algorithms › Prediction and decision losses · approach: Active learning and subset selection

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Closest papers by meaning

• Generalized Convergence Analysis of Tsetlin Automaton Based Algorithms: A Probabilistic Approach to Concept Learning (AAAI 2025 · similarity 0.88)
• MaxSAT-Based Compression for Tsetlin Machines (ICML 2026 · similarity 0.87)
• Drop Clause: Enhancing Performance, Robustness and Pattern Recognition Capabilities of the Tsetlin Machine (AAAI 2023 · similarity 0.87)
• Non-asymptotic Convergence of Training Transformers for Next-token Prediction (NeurIPS 2024 · similarity 0.85)
• Towards Learning High-Precision Least Squares Algorithms with Sequence Models (ICLR 2025 · similarity 0.84)
• Sign-Based Optimizers Are Effective Under Heavy-Tailed Noise (NeurIPS 2026 · similarity 0.84)