
Explore neural set function extensions for integrating discrete functions into neural networks, focusing on continuous domain extensions and high-dimensional representations for combinatorial optimization.

Explore advances in molecular simulation through deep learning, ASIC architectures, and quantum computation. Discover potential applications in sustainable technologies, drug development, and material design.

Explore GFlowNet foundations and applications in biological sequence design. Learn about flow conservation, transition probabilities, and practical implementations for molecule generation and peptide design.

Explore DiGress, a discrete denoising diffusion model for graph generation with categorical attributes. Learn about its innovative approach, challenges, and state-of-the-art performance in molecular and non-molecular datasets.

Explore unsupervised learning of group invariant and equivariant representations. Gain insights into symmetry in data, practical examples, and results for graphs and various symmetries.

Explore Local Search GFlowNets, a novel algorithm enhancing sampling quality for structured sequence generation in drug discovery and other fields through improved targeting of high-reward regions.

Explore Manifold Diffusion Fields for generating continuous functions on Riemannian manifolds. Learn about spectral geometry, intrinsic coordinate systems, and applications in AI for drug discovery.

Explore the linear structure of high-level concepts in text-controlled generative models, focusing on embedding, representation, and semantic encoding for precise model control.

Explore reflected diffusion models for improved image generation. Learn about reversing stochastic differential equations, addressing numerical errors, and incorporating data constraints in principled ways.

Explore advanced techniques for building efficient 3D equivariant graph neural networks, focusing on local substructure encoding and frame transition encoding for improved expressiveness and performance.

Explore how physical processes inspire new generative models, including diffusion and Poisson flow. Learn to translate PDEs into AI algorithms and expand the design space of generative approaches.

Explore optimal control theory's connection to diffusion-based generative modeling. Gain insights into stochastic differential equations, Hamilton-Jacobi-Bellman equations, and novel sampling methods for unnormalized densities.

Explore connections between optimal transport and variational inference, focusing on stochastic differential equations and Girsanov transformations. Discover novel sampling and generative modeling techniques.

Explore a computational framework for solving Wasserstein Lagrangian flows, covering optimal transport variations and applications in single-cell trajectory inference.

Explore the statistical structure of identifiable generative models, focusing on causal representation learning, model identifiability, and unique inferences from observations under suitable assumptions.

Explore Action Matching for learning stochastic dynamics from samples. Discover applications in quantum systems, biology, and generative modeling. Gain insights into novel approaches for simulating trajectories.

Explore Mirror Diffusion Models for generating data on constrained sets, enhancing watermarking capabilities, and improving AI safety in drug discovery applications.

Explore a unified framework for generative models, bridging flow-based and diffusion-based methods using stochastic interpolants. Learn about probability flow equations, likelihood estimation, and applications in AI for drug discovery.

Explore Lilac, a novel separation logic for probabilistic programs, introducing a modality for conditional probability reasoning and validating its effectiveness through formal verification examples.

Explore Propel, a language with a type system for verifying algebraic properties in CRDT implementations. Learn about its case analysis and induction approach for ensuring correctness.

Explore automated verification of a subgraph construction algorithm, focusing on geometric graph properties, edge removal, and connectivity preservation in Euclidean plane representations.