Provable Convergence Bounds for Hybrid Dynamical Sampling and Optimization

Matthew X. Burns, Qingyuan Hou, Michael C. Huang
2/12/2026

No confident code implementation found for this paper. 2 possible matches can be shown below.

Semantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Conditional Common Entropy for Instrumental Variable Testing and Partial Identification

99% match1 repo2026

LiveScene: Language Embedding Interactive Radiance Fields for Physical Scene Control and Rendering

98% match2026

HotProtein: A Novel Framework for Protein Thermostability Prediction and Editing

98% match1 repo322026

A Unified Image Compression Method for Human Perception and Multiple Vision Tasks

98% match2026

Faster Algorithms for Structured Linear and Kernel Support Vector Machines

98% match2026

LOC3DIFF: Local Diffusion for 3D Human Head Synthesis and Editing

98% match2026

Cite this paper

@article{burns2026provable,
  title  = {Provable Convergence Bounds for Hybrid Dynamical Sampling and Optimization},
  author = {Matthew X. Burns and Qingyuan Hou and Michael C. Huang},
  year   = {2026},
  url    = {https://api.semanticscholar.org/CorpusID:3aab6d7cdf35951b8139e78a70dffc979721d639},
  journal = {ICLR 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/3aab6d7cdf35951b8139e78a70dffc979721d639.svg)](https://codeofpaper.com/paper/3aab6d7cdf35951b8139e78a70dffc979721d639)

Discussion