Related papers: Exploring Mount Neverest
A shift from even-aged forest management to uneven-aged management practices leads to a problem rather different from the existing straightforward practice that follows a rotation cycle of artificial regeneration, thinning of inferior trees…
We investigate an overdetermined Torsion problem, with a non-constant positively homogeneous boundary constraint on the gradient. We interpret this problem as the Euler equation of a shape optimization problems, we prove existence and…
In this paper we introduce a new network reachability problem where the goal is to find the most reliable path between two nodes in a network, represented as a directed acyclic graph. Individual edges within this network may fail according…
Bilevel optimization problems embed the optimality of a subproblem as a constraint of another optimization problem. We introduce the concept of near-optimality robustness for bilevel optimization, protecting the upper-level solution…
We investigate an expected utility maximization problem under model uncertainty in a one-period financial market. We capture model uncertainty by replacing the baseline model $\mathbb{P}$ with an adverse choice from a Wasserstein ball of…
Tree search is a fundamental tool for planning, as many sequential decision-making problems can be framed as searching over tree-structured spaces. We propose an uncertainty-guided tree search algorithm for settings where the reward…
Bernstein problem for affine maximal type equation has been a core problem in affine geometry. A conjecture proposed firstly by Chern for entire graph and then extended by Trudinger-Wang to its fully generality asserts that any Euclidean…
We consider a sequence of independent random variables with the known distribution observed sequentially. The observation $n$ is assumed to be a value of one order statistics such as s:n-th, where 1 is less than s is less than n. It the…
We propose a new approach for solving a class of discrete decision making problems under uncertainty with positive cost. This issue concerns multiple and diverse fields such as engineering, economics, artificial intelligence, cognitive…
The subset sum problem is known to be an NP-hard problem in the field of computer science with the fastest known approach having a run-time complexity of $O(2^{0.3113n})$. A modified version of this problem is known as the perfect sum…
We consider the problem of learning the structure of undirected graphical models with bounded treewidth, within the maximum likelihood framework. This is an NP-hard problem and most approaches consider local search techniques. In this…
We study weak quasi-plurisubharmonic solutions to the Dirichlet problem for the complex Monge-Am\`ere equation on a general Hermitian manifold with non-empty boundary. We prove optimal subsolution theorems: for bounded and H\"older…
The article attempts to demonstrate the rich history of one truly remarkable problem situated at the confluence of probability theory and theory of numbers - finding the probability of co-primality of two randomly selected natural numbers.…
One of the classic data mining tasks is to discover bursts, time intervals, where events occur at abnormally high rate. In this paper we revisit Kleinberg's seminal work, where bursts are discovered by using exponential distribution with a…
In 1775, Fagnano introduced the following geometric optimization problem: inscribe a triangle of minimal perimeter in a given acute-angled triangle. A widely accessible solution is provided by the Hungarian mathematician L. Fejer in 1900.…
Following a recent paper by N. Mandache (Inverse Problems 17 (2001), pp. 1435-1444), we establish a general procedure for determining the instability character of inverse problems. We apply this procedure to many elliptic inverse problems…
Loss tomography has been studied for more than 10 years and a number of estimators have been proposed. The estimators can be divided into two classes: maximum likelihood and non-maximum likelihood. The maximum likelihood estimators rely on…
We consider the problem of optimal incomplete transportation between the empirical measure on an i.i.d. uniform sample on the d-dimensional unit cube $[0,1]^d$ and the true measure. This is a family of problems lying in between classical…
We consider the problem of optimal investment with random endowment in a Black--Scholes market for an agent with constant relative risk aversion. Using duality arguments, we derive an explicit expression for the optimal trading strategy,…
Deep learning has been extended to a number of new domains with critical success, though some traditional orienteering problems such as the Travelling Salesman Problem (TSP) and its variants are not commonly solved using such techniques.…