相关论文: On Algorithmic Equiresolution and Stratification o…
In this work we present a new simple but efficient scheme - Subsquares approach - for development of algorithms for enclosing the solution set of overdetermined interval linear systems. We are going to show two algorithms based on this…
A wide variety of problems in machine learning, including exemplar clustering, document summarization, and sensor placement, can be cast as constrained submodular maximization problems. A lot of recent effort has been devoted to developing…
We study and derive algorithms for nonlinear eigenvalue problems, where the system matrix depends on the eigenvector, or several eigenvectors (or their corresponding invariant subspace). The algorithms are derived from an implicit…
Using the structure of the jet schemes of rational double point singularities, we construct "minimal embedded toric resolutions" of these singularities. We also establish, for these singularities, a correspondence between a natural class of…
The toric Hilbert scheme parametrizes all algebras isomorphic to a given semigroup algebra as a multigraded vectorspace. All components of the scheme are toric varieties, and among them, there is a fairly well understood coherent component.…
Algorithms for embedding certain types of nilpotent subalgebras in maximal subalgebras of the same type are developed, using methods of real algebraic groups. These algorithms are applied to determine non-conjugate subalgebras of the…
We describe a new algorithm for computing Whitney stratifications of complex projective varieties. The main ingredients are (a) an algebraic criterion, due to L\^e and Teissier, which reformulates Whitney regularity in terms of conormal…
We extend the recent classification of Hilbert schemes with two Borel-fixed points to arbitrary characteristic. We accomplish this by synthesizing Reeves' algorithm for generating strongly stable ideals with the basic properties of…
Parallel parameterized complexity theory studies how fixed-parameter tractable (fpt) problems can be solved in parallel. Previous theoretical work focused on parallel algorithms that are very fast in principle, but did not take into account…
The main purpose of this paper is twofold. We first want to analyze in details the meaningful geometric aspect of the method introduced in the previous paper [12], concerning regularity of families of irreducible, nodal "curves" on a…
Suppose that there is a ground set which consists of a large number of vectors in a Hilbert space. Consider the problem of selecting a subset of the ground set such that the projection of a vector of interest onto the subspace spanned by…
We present a new algorithm for solving optimization problems with objective functions that are the sum of a smooth function and a (potentially) nonsmooth regularization function, and nonlinear equality constraints. The algorithm may be…
Conditional stability estimates allow us to characterize the degree of ill-posedness of many inverse problems, but without further assumptions they are not sufficient for the stable solution in the presence of data perturbations. We here…
Over the past few years, self-attention is shining in the field of deep learning, especially in the domain of natural language processing(NLP). Its impressive effectiveness, along with ubiquitous implementations, have aroused our interest…
In this paper, we study regression problems over a separable Hilbert space with the square loss, covering non-parametric regression over a reproducing kernel Hilbert space. We investigate a class of spectral/regularized algorithms,…
Embedded principalization of ideals in smooth schemes, also known as Log-resolutions of ideals, play a central role in algebraic geometry. If two sheaves of ideals, say $I_1$ and $I_2$, over a smooth scheme $V$ have the same integral…
Image segmentation is an inherently ill-posed problem and thus requires regularization in order to limit the search space to reasonable solutions. A majority of segmentation methods integrates these regularization terms in one way or the…
Selection of a group of representatives satisfying certain fairness constraints, is a commonly occurring scenario. Motivated by this, we initiate a systematic algorithmic study of a \emph{fair} version of \textsc{Hitting Set}. In the…
The EM (Expectation-Maximization) algorithm is regarded as an MM (Majorization-Minimization) algorithm for maximum likelihood estimation of statistical models. Expanding this view, this paper demonstrates that by choosing an appropriate…
We present an algorithmic embedded desingularization of arithmetic surfaces bearing in mind implementability. Our algorithm is based on work by Cossart-Jannsen-Saito, though our variant uses a refinement of the order instead of the…