
Explore challenges and opportunities for sparse compilers in large language models, focusing on advancements in compiler technology for AI applications.

Explore neural network models predicting heap allocation properties from static code, examining trade-offs, promising directions, and challenges in this innovative approach to memory management.

Explore efficient automatic differentiation for sparse tensors, leveraging novel DSLs and optimizations to outperform existing frameworks in data-intensive applications.

Explore cutting-edge software and hardware solutions for sparse machine learning, enhancing efficiency and performance in ML applications.

Optimize sparse tensor contractions with efficient loop nests and distributed-memory parallelization for improved performance in tensor decomposition and completion tasks.

Explore automated inference of expected result values in probabilistic programs with recursion, procedures, and local variables. Learn about term representation and first-order constraints for analysis automation.

Explore Zar: a verified compiler for discrete probabilistic programs, transforming cpGCL to executable samplers. Learn about choice-fix trees, interaction trees, and sampling equidistribution theorem.

Explore a novel approach for one-pixel adversarial attacks using program synthesis, achieving state-of-the-art success rates with fewer queries and transferable programs for neural network classifiers.

Explore T-complexity costs in quantum error correction for control flow, analyzing performance bottlenecks and optimizing quantum programs for efficient circuit compilation and asymptotic efficiency.

Explore Caesar, a verifier for probabilistic programs, featuring an intermediate verification language and real-valued logic for quantitative property verification in programming.

Explore verified assembly code generation using Dafny and reinforcement learning, combining efficiency with automatic correctness verification for complex programming tasks.

Explore Decalf, a logical framework for analyzing quantitative aspects of effectful functional programs, focusing on cost-aware type theory and its applications to algorithm analysis.

Explore semantic models of probabilistic programming languages over graphs, connecting graphons to equational theories through Markov categories, measure-theoretic probability, and nominal sets.

Explore programmatic strategy synthesis for resolving nondeterminism in probabilistic programs using deductive verification techniques and weakest precondition-style frameworks.

Explore a higher-order programming language for Bayesian networks, combining advanced techniques from linear logic, intersection types, and rewriting theory for efficient probabilistic modeling and inference.

Explore complexity and proof rules for Positive Almost-Sure Termination in probabilistic programming, including recursion-theoretic analysis and novel proof techniques using transfinite ordinals.

Explore cutting-edge research in machine and automata learning at POPL'24, featuring insights from Steven Holtzen on latest advancements and applications.

Explore probabilistic coarse-to-fine program synthesis, a novel approach using iterative refinement of stochastic programs to efficiently search and generate programs matching specifications.

Explore abstract interpretation for automatic differentiation, analyzing its application in machine learning, scientific computing, and graphics.

Explore a technique for finding guaranteed bounds on posterior distributions in probabilistic programs with loops using probability generating functions and inductive invariants.

Explore a novel choice-based learning paradigm combining algebraic effects, handlers, and loss continuations to enhance modularity in machine learning programming.