Related papers: Probabilistic formulation of the Hadwiger--Nelson …
This paper discusses the odds problem, proposed by Bruss in 2000, and its variants. A recurrence relation called a dynamic programming (DP) equation is used to find an optimal stopping policy of the odds problem and its variants. In 2013,…
Single-objective bilevel optimization is a specialized form of constraint optimization problems where one of the constraints is an optimization problem itself. These problems are typically non-convex and strongly NP-Hard. Recently, there…
We prove a multiplier theorem of Mihlin-H\"ormander type for operators of the form $-\Delta_x - V(x) \Delta_y$ on $\mathbb{R}^{d_1}_x \times \mathbb{R}^{d_2}_y$, where $V(x) = \sum_{j=1}^{d_1} V_j(x_j)$, the $V_j$ are perturbations of the…
The supervisory control of probabilistic discrete event systems (PDESs) is investigated under the assumptions that the supervisory controller (supervisor) is probabilistic and has a partial observation. The probabilistic P-supervisor is…
In this work, we consider bilevel optimization when the lower-level problem is strongly convex. Recent works show that with a Hessian-vector product (HVP) oracle, one can provably find an $\epsilon$-stationary point within…
We obtain an explicit H\"older regularity result for viscosity solutions of a class of second order fully nonlinear equations leaded by operator that are neither convex/concave nor uniformly elliptic.
A polynomial algorithm is obtained for the NP-complete linear ordering problem.
We study the probabilistic degree over reals of the OR function on $n$ variables. For an error parameter $\epsilon$ in (0,1/3), the $\epsilon$-error probabilistic degree of any Boolean function $f$ over reals is the smallest non-negative…
A particular instance of the Shortest Vector Problem (SVP) appears in the context of Compute-and-Forward. Despite the NP-hardness of the SVP, we will show that this certain instance can be solved in complexity order $O(n\psi\log(n\psi))$…
Deep Neural Networks (DNN) have improved the quality of several non-safety related products in the past years. However, before DNNs should be deployed to safety-critical applications, their robustness needs to be systematically analyzed. A…
Let S be a p-group for an odd prime p. Bob Oliver conjectures that a certain characteristic subgroup X(S) always contains the Thompson subgroup J(S). We obtain a reformulation of the conjecture as a statement about modular representations…
Ordinal regression (OR) is a special multiclass classification problem where an order relation exists among the labels. Recent years, people share their opinions and sentimental judgments conveniently with social networks and E-Commerce so…
We present a new variant of the secretary problem. Let $A$ be a totally ordered set of $n$ \emph{applicants}. Given $P\subseteq A$ and $x\in A$, let $rr(P,x)=\vert\{z\in P \mid z\leq x\}\vert\mbox{ }$ be the \emph{relative rank of} $x$…
The linear ordering problem (LOP), which consists in ordering M objects from their pairwise comparisons, is commonly applied in many areas of research. While efforts have been made to devise efficient LOP algorithms, verification of whether…
We consider a rather general version of ladder operator $Z$ used by some authors in few recent papers, $[H_0,Z]=\lambda Z$ for some $\lambda\in\mathbb{R}$, $H_0=H_0^\dagger$, and we show that several interesting results can be deduced from…
In this work we revisit the elementary scheduling problem $1||\sum p_j U_j$. The goal is to select, among $n$ jobs with processing times and due dates, a subset of jobs with maximum total processing time that can be scheduled in sequence…
This paper investigates simple bilevel optimization problems where we minimize an upper-level objective over the optimal solution set of a convex lower-level objective. Existing methods for such problems either only guarantee asymptotic…
Reduction operators (called often nonclassical symmetries) of variable coefficient semilinear reaction-diffusion equations with power nonlinearity $f(x)u_t=(g(x)u_x)_x+h(x)u^m$ ($m\neq0,1,2$) are investigated using the algorithm suggested…
We consider the stochastic nested composition optimization problem where the objective is a composition of two expected-value functions. We proposed the stochastic ADMM to solve this complicated objective. In order to find an $\epsilon$…
In this paper, we discuss a supervisory control problem of modular discrete-event systems that allows for a distributed computation of supervisors. We provide a characterization and an algorithm to compute the supervisors. If the…