Related papers: Computing change of level and isogenies between ab…

We develop a gradient-like algorithm to minimize a sum of peer objective functions based on coordination through a peer interconnection network. The coordination admits two stages: the first is to constitute a gradient, possibly with…

Bilevel optimization is a central tool in machine learning for high-dimensional hyperparameter tuning. Its applications are vast; for instance, in imaging it can be used for learning data-adaptive regularizers and optimizing forward…

Bilevel Optimization Programming is used to model complex and conflicting interactions between agents, for example in Robust AI or Privacy-preserving AI. Integrating bilevel mathematical programming within deep learning is thus an essential…

In this paper, we determine the abelianization of the level d mapping class group for d=2 and odd d. We also extend the homomorphism of the Torelli group defined by Heap to a homomorphism of the level 2 mapping class group.

Let K be a number field, let A be a finite dimensional semisimple K-algebra and let Lambda be an O_K-order in A. It was shown in previous work that, under certain hypotheses on A, there exists an algorithm that for a given (left)…

In this paper we propose a new kind of high order numerical scheme for backward stochastic differential equations(BSDEs). Unlike the traditional $\theta$-scheme, we reduce truncation errors by taking $\theta$ carefully for every subinterval…

An efficient algorithm is developed that identifies all independencies implied by the topology of a Bayesian network. Its correctness and maximality stems from the soundness and completeness of d-separation with respect to probability…

Stochastic multi-level compositional optimization problems cover many new machine learning paradigms, e.g., multi-step model-agnostic meta-learning, which require efficient optimization algorithms for large-scale data. This paper studies…

We describe the use of explicit isogenies to translate instances of the Discrete Logarithm Problem (DLP) from Jacobians of hyperelliptic genus 3 curves to Jacobians of non-hyperelliptic genus 3 curves, where they are vulnerable to faster…

Almost asymptotically tight lower bounds are derived for the Input/Output (I/O) complexity $IO_\mathcal{A}\left(n,M\right)$ of a general class of hybrid algorithms computing the product of two integers, each represented with $n$ digits in a…

We construct two abelian varieties over $\mathbb{Q}$ which are not isomorphic, but have isomorphic Mordell--Weil groups over every number field, isomorphic Tate modules and equal values for several other invariants.

Bayesian network classifiers are used in many fields, and one common class of classifiers are naive Bayes classifiers. In this paper, we introduce an approach for reasoning about Bayesian network classifiers in which we explicitly convert…

In computational mechanics, multiple models are often present to describe a physical system. While Bayesian model selection is a helpful tool to compare these models using measurement data, it requires the computationally expensive…

In many practical applications of numerical methods a substantial increase in efficiency can be obtained by using local grid refinement, since the solution is generally smooth in large parts of the domain and large gradients occur only…

Let $k$ be an algebraically closed field of characteristic $p>0$. Let $c,d,m$ be positive integers. Let $D$ be a $p$-divisible group of codimension $c$ and dimension $d$ over $k$. Let $\scrD$ be a versal deformation of $D$ over a smooth…

Let $A=E \times E_{ss}$ be a principally polarized almost ordinary split abelian surface over a finite field $\mathbb{F}_{q}$. We give asymptotic upper and lower bounds on the number of principally polarized abelian surfaces over…

Topological orders can be used as media for topological quantum computing --- a promising quantum computation model due to its invulnerability against local errors. Conversely, a quantum simulator, often regarded as a quantum computing…

Many problems in modern robotics can be addressed by modeling them as bilevel optimization problems. In this work, we leverage augmented Lagrangian methods and recent advances in automatic differentiation to develop a general-purpose…

We prove a lower bound for the size of the isogeny class of a simple abelian variety over a finite field with commutative endomorphism ring in the Lubin-Tate case. Moreover, based on the expected size of the isogeny classes in the Newton…

This paper presents an adaptation of recently developed algorithms for quadratic forms over number fields in arXiv:1304.0708 to global function fields of odd characteristics. First, we present algorithm for checking if a given…