arXiv subjects

Naomi Morato

Publications and source records attributed to Naomi Morato.

3 recordsLinked to original sources

arXiv2026

FactorLibrary: From Polynomials to Circuits via Recursive Subgoals

Finding minimal arithmetic circuits for polynomials over finite fields is a combinatorially hard problem central to algebraic complexity theory. We formulate it as a reinforcement learning problem in two directions, bottom-up and top-down. To address the challenge of a fast-growing combinatorial search space, we introduce FactorLibrary, which stores factorizable subexpressions that serve as reusable subgoals across training episodes. We trained a bottom-up agent with Gumbel-PPO-MCTS and two top-down agents with PPO+MCTS and SAC. The PPO+MCTS top-down agent exhibited the most stable performance, finding certified optimal circuits up to complexity $8$ with a success rate of $91.8\%$.

cs.LG↗

arXiv2026

CircuitBuilder: From Polynomials to Circuits via Reinforcement Learning

Motivated by auto-proof generation and Valiant's VP vs. VNP conjecture, we study the problem of discovering efficient arithmetic circuits to compute polynomials, using addition and multiplication gates. We formulate this problem as a single-player game, where an RL agent attempts to build the circuit within a fixed number of operations. We implement an AlphaZero-style training loop and compare two approaches: Proximal Policy Optimization with Monte Carlo Tree Search (PPO+MCTS) and Soft Actor-Critic (SAC). SAC achieves the highest success rates on two-variable targets, while PPO+MCTS scales to three variables and demonstrates steady improvement on harder instances. These results suggest that polynomial circuit synthesis is a compact, verifiable setting for studying self-improving search policies.

cs.LG↗

arXiv2025

Technosignature Searches of Interstellar Objects

With the discovery of the third confirmed interstellar object (ISO), 3I/ATLAS, we have entered a new phase in the exploration of these long-predicted objects. Though confirmed discovery of ISOs is quite recent, their utility as targets in the search for technosignatures (historically known as the Search for Extraterrestrial Intelligence -- SETI) has been discussed for many decades. With the upcoming NSF-DOE Vera C. Rubin Observatory's Legacy Survey of Space and Time (LSST), the discovery and tracking of such objects is expected to become routine, and thus so must our examination of these objects for possible technosignatures. Here we review the literature surrounding ISOs as targets for technosignatures, which provides a well-developed motivation for such exploration. We outline four broad classes of technosignatures that are well suited for ISO follow-up, including the type of data needed and the best timing for study. Given the limitations in the current understanding of ISOs, we show that care must be taken in identifying technosignatures based primarily on comparison to objects in the Solar System. We therefore provide a roadmap for careful and consistent study of the population of ISOs in the hope of identifying technosignatures.

astro-ph.IM↗