Related papers: Super Solutions of the Model RB
In this paper we formulate a solution of the robust linear regression problem in a general framework of correntropy maximization. Our formulation yields a unified class of estimators which includes the Gaussian and Laplacian kernel-based…
A special initial condition for (1+1)-dimensional Burgers equation is considered. It allows to obtain new analytical solutions for an arbitrary low viscosity as well as for the inviscid case. The viscous solution is written as a rational…
This article shall serve as a quick reference for somebody who needs precise information on concepts and results related to resolution of singularities. As such, it is more a technical manual than a bedtime story. Topics which are covered:…
In this paper, we study the formation of finite time singularities in the form of super norm blowup for a spatially inhomogeneous hyperbolic system. The system is related to the variational wave equations as those in [18]. The system posses…
We establish the satisfiability threshold for random $k$-SAT for all $k\ge k_0$, with $k_0$ an absolute constant. That is, there exists a limiting density $\alpha_*(k)$ such that a random $k$-SAT formula of clause density $\alpha$ is with…
Randomized linear solvers randomly compress and solve a linear system with compelling theoretical convergence rates and computational complexities. However, such solvers suffer a substantial disconnect between their theoretical rates and…
We introduce a comprehensive framework for analyzing convergence rates for infinite dimensional linear programming problems (LPs) within the context of the moment-sum-of-squares hierarchy. Our primary focus is on extending the existing…
Robust optimization typically follows a worst-case perspective, where a single scenario may determine the objective value of a given solution. Accordingly, it is a challenging task to reduce the size of an uncertainty set without changing…
Many NP-complete constraint satisfaction problems appear to undergo a "phase transition'' from solubility to insolubility when the constraint density passes through a critical threshold. In all such cases it is easy to derive upper bounds…
Super-resolution (SR) is an ill-posed inverse problem which consists in proposing high-resolution images consistent with a given low-resolution one. While most SR algorithms are deterministic, stochastic SR deals with designing a stochastic…
The scaling theory of irreversible aggregation is discussed in some detail. First, we review the general theory in the simplest case of binary reactions. We then extend consideration to ternary reactions, multispecies aggregation,…
We give the first efficient algorithm to approximately count the number of solutions in the random $k$-SAT model when the density of the formula scales exponentially with $k$. The best previous counting algorithm for the permissive version…
We prove some sharp regularity results for solutions of classical first order hyperbolic initial boundary value problems. Our two main improvements on the existing litterature are weaker regularity assumptions for the boundary data and…
Super-resolution (SR) techniques aim to enhance data resolution, enabling the retrieval of finer details, and improving the overall quality and fidelity of the data representation. There is growing interest in applying SR methods to complex…
We consider radially symmetric solutions for a class of resonant problems on a unit ball $B \subset R^n$ around the origin \[ \Delta u+\la _1 u +g(u)=f(r) \s \mbox{for $x \in B$}, \s u=0 \s \mbox{on $\partial B$} \,. \] Here the function…
Robust network flows are a concept for dealing with uncertainty and unforeseen failures in the network infrastructure. They and their dual counterpart, network flow interdiction, have received steady attention within the operations research…
The randomization of a complete first order theory T is the complete continuous theory T^R with two sorts, a sort for random elements of models of T, and a sort for events in an underlying probability space. We give necessary and sufficient…
The notion of topological entropy can be conceptualized in terms of the number of forward trajectories that are distinguishable at resolution $\varepsilon$ within $T$ time units. It can then be formally defined as a limit of a limit…
Contention resolution schemes have proven to be an incredibly powerful concept which allows to tackle a broad class of problems. The framework has been initially designed to handle submodular optimization under various types of constraints,…
This paper is concerned with the transient dynamics described by the solutions of the reaction-diffusion equations in which the reaction term consists of a combination of a superlinear power-law absorption and a time-independent point…