相关论文: A priori bounds for certified Krawczyk homotopy tr…

This paper investigates the efficiency of the K-fold cross-validation (CV) procedure and a debiased version thereof as a means of estimating the generalization risk of a learning algorithm. We work under the general assumption of uniform…

We present a new method for generating confidence sets within the split conformal prediction framework. Our method performs a trainable transformation of any given conformity score to improve conditional coverage while ensuring exact…

Let $k$ be a number field and $K$ a finite extension of $k$. We count points of bounded height in projective space over the field $K$ generating the extension $K/k$. As the height gets large we derive asymptotic estimates with a…

We derive fundamental bounds for general quantum metrological models involving both temporal or spatial correlations (mathematically described by quantum combs), which may be effectively computed in the limit of a large number of probes or…

All experiments attempting to verify the invariance of speed of light directly are based on two-way speed measurement. The challenge in one-way speed measurement, the requirement of spatially separated synchronised clocks, can be possibly…

A new pattern search method for bound constrained optimization is introduced. The proposed algorithm employs the coordinate directions, in a suitable way, with a nonmonotone line search for accepting the new iterate, without using…

This monograph reports a multi-agent proof sprint on ten research-level problems, combining rapid draft generation with adversarial verification, targeted repair, and explicit provenance. The workflow uses wiring-diagram decompositions of…

Consider the scattering of a time-harmonic plane wave by a rigid obstacle embedded in a homogeneous and isotropic elastic medium in two dimensions. In this paper, a novel boundary integral formulation is proposed and its highly accurate…

In various applications the search for certificates for certain properties (e.g., stability of dynamical systems, program termination) can be formulated as a quantified constraint solving problem with quantifier prefix exists-forall. In…

This work introduces a novel blackbox optimization algorithm for computationally expensive constrained multi-fidelity problems. When applying a direct search method to such problems, the scarcity of feasible points may lead to numerous…

This paper is motivated by the increasing security concerns of cyber-physical systems. Here, we develop a discretization-free verification scheme targeting an information-flow security property, called approximate initial-state opacity, for…

A key issue of current quantum advantage experiments is that their verification requires a full classical simulation of the ideal computation. This limits the regime in which the experiments can be verified to precisely the regime in which…

We analyse the closed-loop performance of a model predictive control (MPC) for tracking formulation with artificial references. It has been shown that such a scheme guarantees closed-loop stability and recursive feasibility for any…

In this manuscript we prove quantitative homogenization results for the obstacle problem with bounded measurable coefficients. As a consequence, large-scale regularity results both for the solution and the free boundary for the…

We show that a uniform probability measure supported on a specific set of piecewise linear loops in a non-trivial free homotopy class in a multi-punctured plane is overwhelmingly concentrated around loops of minimal lengths. Our approach is…

The adiabatic approximation is well-known method for effective study of few-body systems in molecular, atomic and nuclear physics, using the idea of separation of "fast" and "slow" variables. The generalization of the standard adiabatic…

Conventional multiparameter quantum sensing relies on joint estimation, but this approach faces two key limitations: theoretical bounds may be unattainable due to measurement incompatibility, and sensing may fail due to parameter…

We show that time complexity analysis of higher-order functional programs can be effectively reduced to an arguably simpler (although computationally equivalent) verification problem, namely checking first-order inequalities for validity.…

We present an extension of Adiabatic Quantum Computing (AQC) algorithm for the unstructured search to the case when the number of marked items is unknown. The algorithm maintains the optimal Grover speedup and includes a small counting…

In many iterative optimization methods, fixed-point theory enables the analysis of the convergence rate via the contraction factor associated with the linear approximation of the fixed-point operator. While this factor characterizes the…