Reviewers should be allowed to give a new type of score that indicates "the paper in the current form is a waste of everyone's time".
After N of these papers, an author should not be allowed to submit for a period of time.
Check out our Assistant Professor position @ucsd_cse!
apol-recruit.ucsd.edu/JPF046…
Since it is 2026, it is worth quoting explicitly from the ad that this not AI-specific: “The department is looking for exceptional candidates in all areas of Computer Science and Engineering.”
The reason I've been quiet recently.
Over the last two months I worked hard, using AI, on solving two open problems that my UIUC research lab was not able to solve over the last 7 years.
Finally, we proved them. Viva @AnthropicAI and @OpenAI!
I finally infiltrated the elite program synthesis department at UCSD. 😎
Been a pleasure getting to know @lorisdanto and find ways to collab. Excited to learn more about the PL group’s work.
On the pod: "Constrained Adaptive Rejection Sampling" with @ucsd_cse professor @lorisdanto.
Hear how symbolic AI experts have navigated the LLM era and why the future of AI code generation depends on program synthesis and formal methods.
If you are at #FloC26, come to the workshop on AI for Math and Computer Science (AIMACS) on July 25!
* Tutorial by @KaiyuYang4 on AI-aided theorem-proving
* Tutorial by Clark Barrett and Sorrachai Yingchareonthawornchai on #CSLib, the Lean computer science library
* Talks by @lorisdanto, @gtsoukal, and Moa Johansson
* A panel on how computer scientists should respond to AI progress, with @vardi, @ShriramKMurthi, Pavithra Prabhakar, and Armando Solar-Lezama. I will moderate.
* Many very interesting posters.
program.floc26.org/AIMACS-20…sites.google.com/view/aimacs…
On the pod: "Constrained Adaptive Rejection Sampling" with @ucsd_cse professor @lorisdanto.
Hear how symbolic AI experts have navigated the LLM era and why the future of AI code generation depends on program synthesis and formal methods.
Getting LLMs to generate samples that satisfy constraints is a fundamental problem in machine learning. The standard approach is rejection sampling: generate a sample, check whether it satisfies the constraint, and if not, try again. 1/
This work shows that the structure of constraint checkers can be exploited to accelerate sampling without sacrificing correctness; reminiscent of how conflict-driven clause learning transformed SAT solving by extracting and reusing information from failed search attempts. 6/
At ICML, Jinwoo Kim will present the first approach for enforcing formal structural constraints like regexes, grammars, and schemas on the output of continuous diffusion language models, entirely without retraining. 1/
The result is a training-free constrained generation framework for continuous diffusion language models that can exactly enforce formal syntax constraints while provably preserving generation quality. 4/