Tootfinder

Estimating carbon pools in the shelf sea environment: reanalysis or model-informed machine learning?
Jozef Skakala
https://arxiv.org/abs/2508.10178 https://

Estimating carbon pools in the shelf sea environment: reanalysis or model-informed machine learning?
Shelf seas are important for carbon sequestration and carbon cycle, but available in situ, or satellite data for carbon pools in the shelf sea environment are often sparse, or highly uncertain. Alternative can be provided by reanalyses, but these are often expensive to run. We propose to use an ensemble of neural networks (NN) to learn from a coupled physics-biogeochemistry model the relationship between the directly observable variables and carbon pools. We demonstrate for North-West European …

Trust Region Algorithm for Stochastic Minimax Problems with Decision-Dependent Distributions
Yan Gao, Yongchao Liu, Zili Luo
https://arxiv.org/abs/2509.12868 https://

Trust Region Algorithm for Stochastic Minimax Problems with Decision-Dependent Distributions
Stochastic minimax optimization has drawn much attention over the past decade due to its broad applications in machine learning, signal processing and game theory. In some applications, the probability distribution of uncertainty depends on decision variables, as the environment may respond to decisions. In this paper, we propose a trust region algorithm for finding the stationary points of stochastic minimax problems with decision-dependent distributions. At each iteration, the algorithm local…

Customize what happens when you start R: #rstats #environment

Natural Latents: Latent Variables Stable Across Ontologies
John Wentworth, David Lorell
https://arxiv.org/abs/2509.03780 https://arxiv.org/pdf/2509.03780…

Natural Latents: Latent Variables Stable Across Ontologies
Suppose two Bayesian agents each learn a generative model of the same environment. We will assume the two have converged on the predictive distribution, i.e. distribution over some observables in the environment, but may have different generative models containing different latent variables. Under what conditions can one agent guarantee that their latents are a function of the other agents latents? We give simple conditions under which such translation is guaranteed to be possible: the natura…

Parameterized Infinite-State Reactive Synthesis
Benedikt Maderbacher, Roderick Bloem
https://arxiv.org/abs/2508.00613 https://arxiv.org/pdf/2508.00613

Parameterized Infinite-State Reactive Synthesis
We propose a method to synthesize a parameterized infinite-state systems that can be instantiated for different parameter values. The specification is given in a parameterized temporal logic that allows for data variables as well as parameter variables that encode properties of the environment. Our synthesis method runs in a counterexample-guided loop consisting of four main steps: First, we use existing techniques to synthesize concrete systems for some small parameter instantiations. Second, …

Text2Touch: Tactile In-Hand Manipulation with LLM-Designed Reward Functions
Harrison Field, Max Yang, Yijiong Lin, Efi Psomopoulou, David Barton, Nathan F. Lepora
https://arxiv.org/abs/2509.07445

Text2Touch: Tactile In-Hand Manipulation with LLM-Designed Reward Functions
Large language models (LLMs) are beginning to automate reward design for dexterous manipulation. However, no prior work has considered tactile sensing, which is known to be critical for human-like dexterity. We present Text2Touch, bringing LLM-crafted rewards to the challenging task of multi-axis in-hand object rotation with real-world vision based tactile sensing in palm-up and palm-down configurations. Our prompt engineering strategy scales to over 70 environment variables, and sim-to-real di…

Static Analysis for Detecting Transaction Conflicts in Ethereum Smart Contracts
Zareh Chahoki Atefeh, Roveri Marco
https://arxiv.org/abs/2507.04357 https:/…

Static Analysis for Detecting Transaction Conflicts in Ethereum Smart Contracts
Ethereum smart contracts operate in a concurrent environment where multiple transactions can be submitted simultaneously. However, the Ethereum Virtual Machine (EVM) enforces sequential execution of transactions within each block to prevent conflicts arising from concurrent access to the same state variables. Although this approach guarantees correct behavior, it limits the ability of validators to leverage multi-core architectures for faster transaction processing, thus restricting throughput.…

High-resolution spatial memory requires grid-cell-like neural codes
Madison Cotteret, Christopher J. Kymn, Hugh Greatorex, Martin Ziegler, Elisabetta Chicca, Friedrich T. Sommer
https://arxiv.org/abs/2507.00598

High-resolution spatial memory requires grid-cell-like neural codes
Continuous attractor networks (CANs) are widely used to model how the brain temporarily retains continuous behavioural variables via persistent recurrent activity, such as an animal's position in an environment. However, this memory mechanism is very sensitive to even small imperfections, such as noise or heterogeneity, which are both common in biological systems. Previous work has shown that discretising the continuum into a finite set of discrete attractor states provides robustness to these …

Closure Conversion, Flat Environments, and the Complexity of Abstract Machines
Beniamino Accattoli (Inria & LIX, \'Ecole Polytechnique), Dan Ghica (Huawei Central Software Institute, University of Birmingham), Giulio Guerrieri (University of Sussex), Cl\'audio Belo Louren\c{c}o (Huawei Central Software Institute), Claudio Sacerdoti Coen (Universit\`a di Bologna)

Closure Conversion, Flat Environments, and the Complexity of Abstract Machines
Closure conversion is a program transformation at work in compilers for functional languages to turn inner functions into global ones, by building closures pairing the transformed functions with the environment of their free variables. Abstract machines rely on similar and yet different concepts of closures and environments. In this paper, we study the relationship between the two approaches. We adopt a very simple λ-calculus with tuples as source language and study abstract machines for bot…

First-Order LTLf Synthesis with Lookback (Extended Version)
Sarah Winkler
https://arxiv.org/abs/2508.18149 https://arxiv.org/pdf/2508.18149

First-Order LTLf Synthesis with Lookback (Extended Version)
Reactive synthesis addresses the problem of generating a controller for a temporal specification in an adversarial environment; it was typically studied for LTL. Driven by applications ranging from AI to business process management, LTL modulo first order-theories over finite traces (LTLfMT) has recently gained traction, where propositional variables in properties are replaced by first-order constraints. Though reactive synthesis for LTLf with some first-order features has been addressed, exist…

Day 12
Implemented password reset functionality using JWT:
/auth/remind-password generates a short-lived token and sends it via email
/auth/reset-password verifies the token and updates the password using bcrypt
Validation handled with class-validator.
Endpoints documented with Swagger.
Token secret and base URL configured via environment variables.