Related papers: Extension Condition "violations" and Merge optimal…

Migration presents sweeping societal challenges that have recently attracted significant attention from the scientific community. One of the prominent approaches that have been suggested employs optimization and machine learning to match…

In the modern language sciences, the core computational operation of syntax, 'Merge', is defined as an operation that combines two linguistic units (e.g., 'brown', 'cat') to form a categorized structure ('brown cat', a Noun Phrase). This…

We revisit the formulation of the principle of minimal flavor violation (MFV) in the minimal supersymmetric extension of the standard model, both at moderate and large tan(beta), and with or without new CP-violating phases. We introduce a…

This tutorial describes recently developed general optimality conditions for Markov Decision Processes that have significant applications to inventory control. In particular, these conditions imply the validity of optimality equations and…

The basis of the $\{\beta\}$-expansion for the perturbative series evaluated in the $\overline{MS}$ scheme for the renormalization group invariant quantities is summarized.Comparison with a similar representation,used within the…

We present a unified study of first and second order necessary and sufficient optimality conditions for minimax and Chebyshev optimisation problems with cone constraints. First order optimality conditions for such problems can be formulated…

We explore the necessary conditions for 1-form symmetries to emerge in the long-distance limit when they are explicitly broken at short distances. A minimal requirement is that there exist operators which become topological at long…

Study about theory and algorithms for constrained optimization usually assumes that the feasible region of the optimization problem is nonempty. However, there are many important practical optimization problems whose feasible regions are…

This article makes no claim to originality, other than, perhaps, the simple statement here called the {\it Abstract Maximum Principle}. Actually, the whole contents are strongly based on some H. Sussmann's and coauthors' papers, in which,…

We introduce a general random model of a combinatorial optimization problem with geometric structure that encapsulates both linear programming and integer linear programming. Let $Q$ be a bounded set called the feasible set, $E$ be an…

Suitable reachability conditions can make two different fixed point semantics of a transition system coincide. For instance, the total and partial expected reward semantics on Markov chains (MCs) coincide whenever the MC at hand is almost…

Among the major difficulties that one may encounter when estimating parameters in a nonlinear regression model are the nonuniqueness of the estimator, its instability with respect to small perturbations of the observations and the presence…

Optimal unbounded control problems with affine control dependence may fail to have minimizers in the class of absolutely continuous state trajectories. For this reason, extended impulsive versions --which cannot be of measure-theoretical…

A semilinear parabolic equation with constraint modeling the dynamics of a microelectromechanical system (MEMS) is studied. In contrast to the commonly used MEMS model, the well-known pull-in phenomenon occurring above a critical potential…

Minimal Phenomenal Experiences (MPEs) are states of consciousness in which wakefulness is preserved but phenomenal content is low or absent. The Entropic Brain Hypothesis (EBH) is a model of conscious processes that regards the entropy of…

We consider an $\ell_0$-minimization problem where $f(x) + \gamma \|x\|_0$ is minimized over a polyhedral set and the $\ell_0$-norm regularizer implicitly emphasizes sparsity of the solution. Such a setting captures a range of problems in…

We work under the A\"{\i}d\'{e}kon-Chen conditions which ensure that the derivative martingale in a supercritical branching random walk on the line converges almost surely to a nondegenerate nonnegative random variable that we denote by…

We study dynamic minimization problems of the calculus of variations with generalized Lagrangian functionals that depend on a general linear operator $K$ and defined on bounded-time intervals. Under assumptions of regularity, convexity and…

In some optimal control problems, complex relationships between states and inputs cannot be easily represented using continuous constraints, necessitating the use of discrete logic instead. This paper presents a method for incorporating…

Model interpretability has become an important problem in machine learning (ML) due to the increased effect that algorithmic decisions have on humans. Counterfactual explanations can help users understand not only why ML models make certain…