SearcharxivSearch

arXiv subjects

Yuri Chervonyi

Publications and source records attributed to Yuri Chervonyi.

17 recordsLinked to original sources

MaD Physics: Evaluating information seeking under constraints in physical environments

Scientific discovery is fundamentally a resource-constrained process that requires navigating complex trade-offs between the quality and quantity of measurements due to physical and cost constraints. Measurements drive the scientific process by revealing novel phenomena to improve our understanding. Existing benchmarks for evaluating agents for scientific discovery focus on either static knowledge-based reasoning or unconstrained experimental design tasks, and do not capture the ability to make measurements and plan under constraints. To bridge this gap, we propose Measuring and Discovering Physics (MaD Physics), a benchmark to evaluate the ability of agents to make informative measurements and conclusions subject to constraints on the quality and quantity of measurements. The benchmark consists of three environments, each based on a distinct physical law. To mitigate contamination from existing knowledge, MaD Physics includes altered physical laws. In each trial, the agent makes measurements of the system until it exhausts an allotted budget and then the agent has to infer the underlying physical law to make predictions about the state of the system in the future. MaD Physics evaluates two fundamental capabilities of scientific agents: inferring models from data and planning under constraints. We also demonstrate how MaD Physics can be used to evaluate other capabilities such as multimodality and in-context learning. We benchmark agents on MaD Physics using four Gemini models (2.5 Flash Lite, 2.5 Flash, 2.5 Pro, and 3 Flash), identifying shortcomings in their structured exploration and data collection capabilities and highlighting directions to improve their scientific reasoning.

cs.AI

Aletheia tackles FirstProof autonomously

We report the performance of Aletheia (Feng et al., 2026b), a mathematics research agent powered by Gemini 3 Deep Think, on the inaugural FirstProof challenge. Within the allowed timeframe of the challenge, Aletheia autonomously solved 6 problems (2, 5, 7, 8, 9, 10) out of 10 according to majority expert assessments; we note that experts were not unanimous on Problem 8 (only). For full transparency, we explain our interpretation of FirstProof and disclose details about our experiments as well as our evaluation. Raw prompts and outputs are available at https://github.com/google-deepmind/superhuman/tree/main/aletheia.

cs.AI

Towards Autonomous Mathematics Research

Recent advances in foundational models have yielded reasoning systems capable of achieving a gold-medal standard at the International Mathematical Olympiad. The transition from competition-level problem-solving to professional research, however, requires navigating vast literature and constructing long-horizon proofs. In this work, we introduce Aletheia, a math research agent that iteratively generates, verifies, and revises solutions end-to-end in natural language. Specifically, Aletheia is powered by an advanced version of Gemini Deep Think for challenging reasoning problems, a novel inference-time scaling law that extends beyond Olympiad-level problems, and intensive tool use to navigate the complexities of mathematical research. We demonstrate the capability of Aletheia from Olympiad problems to PhD-level exercises and most notably, through several distinct milestones in AI-assisted mathematics research: (a) a research paper (Feng26) generated by AI without any human intervention in calculating certain structure constants in arithmetic geometry called eigenweights; (b) a research paper (LeeSeo26) demonstrating human-AI collaboration in proving bounds on systems of interacting particles called independent sets; and (c) an extensive semi-autonomous evaluation (Feng et al., 2026a) of 700 open problems on Bloom's Erdos Conjectures database, including autonomous solutions to four open questions. In order to help the public better understand the developments pertaining to AI and mathematics, we suggest quantifying standard levels of autonomy and novelty of AI-assisted results, as well as propose a novel concept of human-AI interaction cards for transparency. We conclude with reflections on human-AI collaboration in mathematics and share all prompts as well as model outputs at https://github.com/google-deepmind/superhuman/tree/main/aletheia.

cs.LG

Semi-Autonomous Mathematics Discovery with Gemini: A Case Study on the Erdős Problems

We present a case study in semi-autonomous mathematics discovery, using Gemini to systematically evaluate 700 conjectures labeled 'Open' in Bloom's Erdős Problems database. We employ a hybrid methodology: AI-driven natural language verification to narrow the search space, followed by human expert evaluation to gauge correctness and novelty. We address 13 problems that were marked 'Open' in the database: 5 through seemingly novel autonomous solutions, and 8 through identification of previous solutions in the existing literature. Our findings suggest that the 'Open' status of the problems was through obscurity rather than difficulty. We also identify and discuss issues arising in applying AI to math conjectures at scale, highlighting the difficulty of literature identification and the risk of ''subconscious plagiarism'' by AI. We reflect on the takeaways from AI-assisted efforts on the Erdős Problems.

cs.AI

Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2

We present AlphaGeometry2 (AG2), a significantly improved version of AlphaGeometry introduced in (Trinh et al., 2024), which has now surpassed an average gold medalist in solving Olympiad geometry problems. To achieve this, we first extend the original AlphaGeometry language to tackle problems involving movements of objects, and problems containing linear equations of angles, ratios, and distances. This, together with support for non-constructive problems, has markedly improved the coverage rate of the AlphaGeometry language on International Math Olympiads (IMO) 2000-2024 geometry problems from 66% to 88%. The search process of AG2 has also been greatly improved through the use of Gemini architecture for better language modeling, and a novel knowledge-sharing mechanism that enables effective communication between search trees. Together with further enhancements to the symbolic engine and synthetic data generation, we have significantly boosted the overall solving rate of AG to 84% on all geometry problems over the last 25 years, compared to 54% previously. AG2 was also part of the system that achieved the silver-medal standard at IMO 2024 https://deepmind.google/blog/ai-solves-imo-problems-at-silver-medal-level/. Finally, we report progress towards using AG2 as a part of a fully automated system that reliably solves geometry problems from natural language input. Code: https://github.com/google-deepmind/alphageometry2.

cs.AI

Towards Robust Mathematical Reasoning

Finding the right north-star metrics is highly critical for advancing the mathematical reasoning capabilities of foundation models, especially given that existing evaluations are either too easy or only focus on getting correct short answers. To address these issues, we present IMO-Bench, a suite of advanced reasoning benchmarks, vetted by a panel of top specialists and that specifically targets the level of the International Mathematical Olympiad (IMO), the most prestigious venue for young mathematicians. IMO-AnswerBench first tests models on 400 diverse Olympiad problems with verifiable short answers. IMO-Proof Bench is the next-level evaluation for proof-writing capabilities, which includes both basic and advanced IMO level problems as well as detailed grading guidelines to facilitate automatic grading. These benchmarks played a crucial role in our historic achievement of the gold-level performance at IMO 2025 with Gemini Deep Think (Luong and Lockhart, 2025). Our model achieved 80.0% on IMO-AnswerBench and 65.7% on the advanced IMO-Proof Bench, surpassing the best non-Gemini models by large margins of 6.9% and 42.4% respectively. We also showed that autograders built with Gemini reasoning correlate well with human evaluations and construct IMO-GradingBench, with 1000 human gradings on proofs, to enable further progress in automatic evaluation of long-form answers. We hope that IMO-Bench will help the community towards advancing robust mathematical reasoning and release it at https://imobench.github.io/.

cs.CL

Towards practical reinforcement learning for tokamak magnetic control

Reinforcement learning (RL) has shown promising results for real-time control systems, including the domain of plasma magnetic control. However, there are still significant drawbacks compared to traditional feedback control approaches for magnetic confinement. In this work, we address key drawbacks of the RL method; achieving higher control accuracy for desired plasma properties, reducing the steady-state error, and decreasing the required time to learn new tasks. We build on top of \cite{degrave2022magnetic}, and present algorithmic improvements to the agent architecture and training procedure. We present simulation results that show up to 65\% improvement in shape accuracy, achieve substantial reduction in the long-term bias of the plasma current, and additionally reduce the training time required to learn new tasks by a factor of 3 or more. We present new experiments using the upgraded RL-based controllers on the TCV tokamak, which validate the simulation results achieved, and point the way towards routinely achieving accurate discharges using the RL approach.

physics.plasm-ph

Controlling Commercial Cooling Systems Using Reinforcement Learning

This paper is a technical overview of DeepMind and Google's recent work on reinforcement learning for controlling commercial cooling systems. Building on expertise that began with cooling Google's data centers more efficiently, we recently conducted live experiments on two real-world facilities in partnership with Trane Technologies, a building management system provider. These live experiments had a variety of challenges in areas such as evaluation, learning from offline data, and constraint satisfaction. Our paper describes these challenges in the hope that awareness of them will benefit future applied RL work. We also describe the way we adapted our RL system to deal with these challenges, resulting in energy savings of approximately 9% and 13% respectively at the two live experiment sites.

cs.LG

Optimizing Industrial HVAC Systems with Hierarchical Reinforcement Learning

Reinforcement learning (RL) techniques have been developed to optimize industrial cooling systems, offering substantial energy savings compared to traditional heuristic policies. A major challenge in industrial control involves learning behaviors that are feasible in the real world due to machinery constraints. For example, certain actions can only be executed every few hours while other actions can be taken more frequently. Without extensive reward engineering and experimentation, an RL agent may not learn realistic operation of machinery. To address this, we use hierarchical reinforcement learning with multiple agents that control subsets of actions according to their operation time scales. Our hierarchical approach achieves energy savings over existing baselines while maintaining constraints such as operating chillers within safe bounds in a simulated HVAC control environment.

cs.LG

Semi-analytical Industrial Cooling System Model for Reinforcement Learning

We present a hybrid industrial cooling system model that embeds analytical solutions within a multi-physics simulation. This model is designed for reinforcement learning (RL) applications and balances simplicity with simulation fidelity and interpretability. The model's fidelity is evaluated against real world data from a large scale cooling system. This is followed by a case study illustrating how the model can be used for RL research. For this, we develop an industrial task suite that allows specifying different problem settings and levels of complexity, and use it to evaluate the performance of different RL algorithms.

cs.AI

Zap: Making Predictions Based on Online User Behavior

This paper introduces Zap, a generic machine learning pipeline for making predictions based on online user behavior. Zap combines well known techniques for processing sequential data with more obscure techniques such as Bloom filters, bucketing, and model calibration into an end-to-end solution. The pipeline creates website- and task-specific models without knowing anything about the structure of the website. It is designed to minimize the amount of website-specific code, which is realized by factoring all website-specific logic into example generators. New example generators can typically be written up in a few lines of code.

cs.LG

Hidden symmetries in string theory

In this dissertation we study hidden symmetries within the framework of string theory. There are two kinds of hidden symmetries investigated in this work: the first type is associated with dynamics of quantum fields and the second type is related to integrability of strings on various backgrounds. The goals of this thesis are twofold: extension of hidden symmetries known in general relativity to stringy backgrounds in higher dimensions and construction of new integrable string theories. In the context of the first goal we study hidden symmetries of stringy backgrounds, with and without supersymmetry. For supersymmetric geometries produced by D--branes we identify the backgrounds with solvable equations for geodesics, which can potentially give rise to integrable string theories. Relaxing the requirement of supersymmetry, we also study charged black holes in higher dimensions and identify their hidden symmetries encoded in so--called Killing(-Yano) tensors. We construct the explicit form of the Killing(-Yano) tensors for the charged rotating black hole in arbitrary number of dimensions, study behavior of such tensors under string dualities, and use the analysis of hidden symmetries to explain why exact solutions for black rings (black holes with non-spherical event horizons) in more than five dimensions remain elusive. As a byproduct we identify the standard parameterization of AdSp x S^q backgrounds with elliptic coordinates on a flat base. The second goal of this work is construction of new integrable string theories by applying continuous deformations of known examples. We use the recent developments called (generalized) lambda-deformation to construct new integrable backgrounds depending on several continuous parameters and study analytical properties of the such deformations.

hep-th

Generalized $λ$-deformations of AdS_p x S^p

We study analytical properties of the generalized $λ$-deformation, which modifies string theories while preserving integrability, and construct the explicit backgrounds corresponding to AdS_p x S^p, including the Ramond-Ramond fluxes. For an arbitrary coset, we find the general form of the R-matrix underlying the deformation, and prove that the dilaton is not modified by the deformation, while the frames are multiplied by a constant matrix. Our explicit solutions describe families of integrable string theories depending on several continuous parameters.

hep-th

Supergravity background of the lambda-deformed AdS_3 x S^3 supercoset

We construct the solution of type IIB supergravity describing the integrable lambda-deformation of the AdS_3 x S^3 supercoset. While the geometry corresponding to the deformation of the bosonic coset has been found in the past, our background is more natural for studying superstrings, and several interesting features distinguish our solution from its bosonic counterpart. We also report progress towards constructing the lambda-deformation of the AdS_5 x S^5 supercoset.

hep-th

Killing(-Yano) Tensors in String Theory

We construct the Killing(-Yano) tensors for a large class of charged black holes in higher dimensions and study general properties of such tensors, in particular, their behavior under string dualities. Killing(-Yano) tensors encode the symmetries beyond isometries, which lead to insights into dynamics of particles and fields on a given geometry by providing a set of conserved quantities. By analyzing the eigenvalues of the Killing tensor, we provide a prescription for constructing several conserved quantities starting from a single object, and we demonstrate that Killing tensors in higher dimensions are always associated with ellipsoidal coordinates. We also determine the transformations of the Killing(-Yano) tensors under string dualities, and find the unique modification of the Killing-Yano equation consistent with these symmetries. These results are used to construct the explicit form of the Killing(-Yano) tensors for the Myers-Perry black hole in arbitrary number of dimensions and for its charged version.

hep-th

Towards higher dimensional black rings

Despite all attempts, exact solutions for black rings in more than five dimensions remain elusive. In this paper we clarify some of the reasons for that, in particular we show that a peculiar symmetry of the five--dimensional black ring - separability of the base - cannot occur in dimensions higher than five. We also construct supersymmetric solutions that have symmetries of 5D supersymmetric black ring and show that they do not have regular horizons.

hep-th

(Non)-Integrability of Geodesics in D-brane Backgrounds

Motivated by the search for new backgrounds with integrable string theories, we classify the D-brane geometries leading to integrable geodesics. Our analysis demonstrates that the Hamilton-Jacobi equation for massless geodesics can only separate in elliptic or spherical coordinates, and all known integrable backgrounds are covered by this separation. In particular, we identify the standard parameterization of AdS_p X S^q with elliptic coordinates on a flat base. We also find new geometries admitting separation of the Hamilton-Jacobi equation in the elliptic coordinates. Since separability of this equation is a necessary condition for integrability of strings, our analysis gives severe restrictions on the potential candidates for integrable string theories.

hep-th