arXiv:2604.07496v1 Announce Type: new Abstract: The theory of uninterpreted functions is a key modeling tool for systems with unknown or abstracted components. Some domains such as systems biology impose further restrictions regarding monotonicity on these components, requiring specific inputs to have a consistently positive or negative effect on the output. In this paper, we tackle the model inference problem for biological systems by applying the theory of uninterpreted functions with monotonicity constraints. We compare the performance of naive […]

Ver mais

Introduction Today’s global digital platforms are powered by hundreds of microservices that run behind the frontend that users are exposed to. These services all have to operate at scale in conjunction with each other. Hence, the ultimate user experience is determined by the composite availability of these systems, engineered so that the final service continues to operate even if subsystems experience outages. Talking about availability standards of 5 9s, systems that are available 99.999% of the time are […]

Ver mais

The opposite of knowledge is not ignorance. I type fast. Years of specific hand positions, now firing without thought. I learned, recently, that if I want to type significantly faster, I cannot simply practice more. My lack of speed comes from sub-optimal finger movements that have become reflexive. I have to get slower first. I have to rewire the motor patterns before I can reach something mathematically more optimal. This is how skill works when your scheme is […]

Ver mais

arXiv:2601.16990v1 Announce Type: new Abstract: Bibliometric analysis is a critical tool for understanding the structure, dynamics, and impact of scientific research. Traditional methods often fall short in capturing the intricate relationships and evolving trends within scientific literature. To address this gap, we present pyBiblioNet, a Python library designed to facilitate comprehensive network-based bibliometric analysis, providing insights into citation networks, co-authorship networks, and keyword co-occurrence networks. The library integrates with OpenAlex, a popular and open catalogue to the global […]

Ver mais

Pretext Exciting new browser library from Cheng Lou, previously a React core developer and the original creator of the react-motion animation library. Pretext solves the problem of calculating the height of a paragraph of line-wrapped text without touching the DOM. The usual way of doing this is to render the text and measure its dimensions, but this is extremely expensive. Pretext uses an array of clever tricks to make this much, much faster, which enables all sorts of […]

Ver mais

arXiv:2505.13809v4 Announce Type: replace-cross Abstract: Off-policy evaluation (OPE) constructs confidence intervals for the value of a target policy using data generated under a different behavior policy. Most existing inference methods focus on fixed target policies and may fail when the target policy is estimated as optimal, particularly when the optimal policy is non-unique or nearly deterministic. We study inference for the value of optimal policies in Markov decision processes. We characterize the existence of the efficient influence function […]

Ver mais

Shared autonomy systems require principled methods for inferring user intent and determining appropriate assistance levels. This is a central challenge in human-robot interaction, where systems must be successful while being mindful of user agency. Previous approaches relied on static blending ratios or separated goal inference from assistance arbitration, leading to suboptimal performance in unstructured environments. We introduce BRACE (Bayesian Reinforcement Assistance with Context Encoding), a novel framework that fine-tunes Bayesian intent inference and context-adaptive assistance through an architecture […]

Ver mais

arXiv:2601.03381v1 Announce Type: new Abstract: We consider turn-based stochastic two-player games with a combination of a parity condition that must hold surely, that is in all possible outcomes, and of a parity condition that must hold almost-surely, that is with probability 1. The problem of deciding the existence of a winning strategy in such games is central in the framework of synthesis beyond worst-case where a hard requirement that must hold surely is combined with a softer requirement. […]

Ver mais