相关论文: A simpler way of imposing simplicity constraints

Models with fewer parameters are often easier to interpret and more robust. Parsimony can be achieved through optimizing objectives like the AIC or BIC, which are functions of the the number of free parameters in the model. Optimizing this…

Simulation has become the evaluation method of choice for many areas of distributing computing research. However, most existing simulation packages have several limitations on the size and complexity of the system being modeled. Fine…

Arithmetic constraints on integer intervals are supported in many constraint programming systems. We study here a number of approaches to implement constraint propagation for these constraints. To describe them we introduce integer interval…

In many problems in optimal control, one seeks to minimise an objective function subject to constraints on the velocity of the system. Imposing these constraints directly -- the ``hard-constrained'' approach -- is often analytically and…

In this paper, we consider a compact Riemannian manifold with boundary, endowed with a magnetic potential $\alpha$ and a potential $U$. For brevity, this type of systems are called $\MP$-systems. On simple $\MP$-systems, we consider both…

We revisit the SeqBin constraint. This meta-constraint subsumes a number of important global constraints like Change, Smooth and IncreasingNValue. We show that the previously proposed filtering algorithm for SeqBin has two drawbacks even…

We introduce a new invariant defined on the vertices of a given filtered simplicial complex, called codensity, which controls the impact of removing vertices on persistent homology. We achieve this control through the use of an interleaving…

Asymptotic homogenisation is considered for problems with integral constraints imposed on a slowly-varying microstructure; an insulator with an array of perfectly dielectric inclusions of slowly varying size serves as a paradigm. Although…

The inverse statistical problem of finding direct interactions in complex networks is difficult. In the natural sciences, well-controlled perturbation experiments are widely used to probe the structure of complex networks. However, our…

We study propagation of the RegularGcc global constraint. This ensures that each row of a matrix of decision variables satisfies a Regular constraint, and each column satisfies a Gcc constraint. On the negative side, we prove that…

We propose a method to impose homogeneous linear inequality constraints of the form $Ax\leq 0$ on neural network activations. The proposed method allows a data-driven training approach to be combined with modeling prior knowledge about the…

The min-knapsack problem with compactness constraints extends the classical knapsack problem, in the case of ordered items, by introducing a restriction ensuring that they cannot be too far apart. This problem has applications in…

In this work we study a Spin Foam model for 4d Riemannian gravity, and propose a new way of imposing the simplicity constraints that uses the recently developed holomorphic representation. Using the power of the holomorphic integration…

This paper presents a coordinate-free formulation of virtual holonomic constraints for underactuated Lagrangian control systems on Riemannian manifolds. It is shown that when a virtual constraint enjoys a regularity property, the…

Enforcing complex (e.g., nonconvex) operational constraints is a critical challenge in real-world learning and control systems. However, existing methods struggle to efficiently enforce general classes of constraints. To address this, we…

We introduce a novel generative formulation of deep probabilistic models implementing "soft" constraints on their function dynamics. In particular, we develop a flexible methodological framework where the modeled functions and derivatives…

Classical Heisenberg spins in the continuum limit (i.e. the nonlinear sigma-model) are studied on an elastic cylinder section with homogeneous boundary conditions. The latter may serve as a physical realization of magnetically coated…

We consider how mathematical models enable predictions for conditions that are qualitatively different from the training data. We propose techniques based on information topology to find models that can apply their learning in regimes for…

A generalization of the $SU(2)$--spin systems on a lattice and their continuum limit to an arbitrary compact group $G$ is discussed. The continuum limits are, in general, non--relativistic $\sigma$--model type field theories targeted on a…

We introduce a novel method for solving density-based topology optimization problems: Sigmoidal Mirror descent with a Projected Latent variable (SiMPL). The SiMPL method (pronounced as ``the simple method'') optimizes a design using only…