相关论文: Scrambled Polynomial Lattice Rules for Infinite-Di…

Bounding is one of the important gaits in quadrupedal locomotion for negotiating obstacles. The authors proposed an effective approach that can learn robust bounding gaits more efficiently despite its large variation in dynamic body…

Exploiting tools from algebraic geometry, the problem of finiteness of determination of accessibility/strong accessibility is investigated for polynomial systems and also for analytic systems that are immersible into polynomial systems. The…

Consider the scattering of a time-harmonic acoustic incident wave by a bounded, penetrable, and isotropic elastic solid, which is immersed in a homogeneous compressible air or fluid. The paper concerns the numerical solution for such an…

Quasi-Monte Carlo (QMC) quadrature rules using higher order digital nets and sequences have been shown to achieve the almost optimal rate of convergence of the worst-case error in Sobolev spaces of arbitrary fixed smoothness $\alpha\in…

Conic optimization has recently emerged as a powerful tool for designing tractable and guaranteed algorithms for non-convex polynomial optimization problems. On the one hand, tractability is crucial for efficiently solving large-scale…

Stochastic simulations are used to characterize the knotting distributions of random ring polymers confined in spheres of various radii. The approach is based on the use of multiple Markov chains and reweighting techniques, combined with…

Using neural networks to solve variational problems, and other scientific machine learning tasks, has been limited by a lack of consistency and an inability to exactly integrate expressions involving neural network architectures. We address…

The Hermite polynomials are ubiquitous but can be difficult to work with due to their unwieldy definition in terms of derivatives. To remedy this, we showcase an underappreciated Gaussian integral formula for the Hermite polynomials, which…

We study the complexity of constraint satisfaction problems involving global constraints, i.e., special-purpose constraints provided by a solver and represented implicitly by a parametrised algorithm. Such constraints are widely used;…

We study the problem of clustering networks whose nodes have imputed or physical positions in a single dimension, for example prestige hierarchies or the similarity dimension of hyperbolic embeddings. Existing algorithms, such as the…

This paper aims at the study of controllability properties and induced controllability metrics on complex networks governed by a class of (discrete time) linear decision processes with mul-tiplicative noise. The dynamics are given by a…

Entangled networks of stiff biopolymers exhibit complex dynamic response, emerging from the topological constraints that neighboring filaments impose upon each other. We propose a class of reference models for entanglement dynamics of stiff…

The notion of multidimensional quadrilateral lattice is introduced. It is shown that such a lattice is characterized by a system of integrable discrete nonlinear equations. Different useful formulations of the system are given. The…

We discuss the relation between entanglement and criticality in translationally invariant harmonic lattice systems with non-randon, finite-range interactions. We show that the criticality of the system as well as validity or break-down of…

We introduce \emph{coarse scrambling}, a novel randomization for digital sequences that permutes blocks of digits in a mixed-radix representation. This construction is designed to preserve the powerful $(0,\boldsymbol{e},d)$-sequence…

The problem of straggler mitigation in distributed matrix multiplication (DMM) is considered for a large number of worker nodes and a fixed small finite field. Polynomial codes and matdot codes are generalized by making use of algebraic…

A comprehensive overview of lattice rules and polynomial lattice rules is given for function spaces based on $\ell_p$ semi-norms. Good lattice rules and polynomial lattice rules are defined as those obtaining worst-case errors bounded by…

Current high-resolution imaging techniques require an intact sample that preserves spatial relationships. We here present a novel approach, "puzzle imaging," that allows imaging a spatially scrambled sample. This technique takes many…

This paper presents a novel numerical optimisation method for infinite dimensional optimisation. The functional optimisation makes minimal assumptions about the functional and without any specific knowledge on the derivative of the…

Interpretability benefits the theoretical understanding of representations. Existing word embeddings are generally dense representations. Hence, the meaning of latent dimensions is difficult to interpret. This makes word embeddings like a…