Related papers: Computation of Differential Chow Forms for Prime D…
In the algorithm Intersort, Chevalley et al. (2024) proposed a score-based method to discover the causal order of variables in a Directed Acyclic Graph (DAG) model, leveraging interventional data to outperform existing methods. However, as…
We consider a general class of two-stage distributionally robust optimization (DRO) problems where the ambiguity set is constrained by fixed marginal probability laws that are not necessarily discrete. We derive primal and dual formulations…
Recent work due to Goel et al. gave the first efficient algorithms for learning with distribution shift in the challenging PQ framework. In this setting, a learner receives labeled training examples, unlabeled test examples, and must make…
This paper contains an account of arbitrary cubic function fields of characteristic three. We define a standard form for an arbitrary cubic curve and consider its function field. By considering an integral basis for the maximal order of…
Differential privacy is a de facto standard for statistical computations over databases that contain private data. The strength of differential privacy lies in a rigorous mathematical definition that guarantees individual privacy and yet…
A computationally efficient high-order solver is developed to compute the wall distances by solving the relevant partial differential equations, namely: Eikonal, Hamilton-Jacobi (HJ) and Poisson equations. In contrast to the upwind schemes…
We present a numerical method for rigorous over-approximation of a reachable set of differential inclusions. The method gives high-order error bounds for single step approximations and a uniform bound on the error over the finite time…
Here we present an algorithm to find elementary first integrals of rational second order ordinary differential equations (SOODEs). In \cite{PS2}, we have presented the first algorithmic way to deal with SOODEs, introducing the basis for the…
We investigate improvements to the algorithm for the computation of ideal class groups described by Jacobson in the imaginary quadratic case. These improvements rely on the large prime strategy and a new method for performing the linear…
This paper proposes a new algorithm for an automatic variable selection procedure in High Dimensional Graphical Models. The algorithm selects the relevant variables for the node of interest on the basis of mutual information. Several…
Finding the optimal hyperparameters of a model can be cast as a bilevel optimization problem, typically solved using zero-order techniques. In this work we study first-order methods when the inner optimization problem is convex but…
In this paper we study planar polynomial differential systems of this form: dX/dt=A(X, Y), dY/dt= B(X, Y), where A,B belongs to Z[X, Y], degA \leq d, degB \leq d, and the height of A and B is smaller than H. A lot of properties of planar…
Codebooks with small maximum cross-correlation amplitudes are used to distinguish the signals from different users in CDMA communication systems. In this paper, we first study the Jacobi sums over Galois rings of arbitrary characteristics…
This paper presents algorithms for calculating the quadratic character and the norms of prime ideals in the ring of integers of any quadratic field. The norms of prime ideals are obtained by means of a sieve algorithm using the quadratic…
We present an algorithm which allows to solve analytically linear systems of differential equations which factorize to first order. The solution is given in terms of iterated integrals over an alphabet where its structure is implied by the…
We analyse the forward error in the floating point summation of real numbers, from algorithms that do not require recourse to higher precision or better hardware. We derive informative explicit expressions, and new deterministic and…
We consider the problem of a firm seeking to use personalized pricing to sell an exogenously given stock of a product over a finite selling horizon to different consumer types. We assume that the type of an arriving consumer can be observed…
We give an algorithm for computing the factor ring of a given ideal in a Dedekind domain with finite rank, which runs in deterministic and polynomial-time. We provide two applications of the algorithm: judging whether a given ideal is prime…
We develop a new method for equality constrained optimization problems based on a sequential cubic programming framework. Each iteration utilizes a step decomposition based on the Jacobian of the constraints into a normal and a tangential…
This paper addresses the efficient computation of Jacobian matrices for programs composed of sequential differentiable subprograms. By representing the overall Jacobian as a chain product of the Jacobians of these subprograms, we reduce the…