相关论文: Are Gross Substitutes a Substitute for Submodular …
It has been observed that the performances of many high-dimensional estimation problems are universal with respect to underlying sensing (or design) matrices. Specifically, matrices with markedly different constructions seem to achieve…
Submodular function maximization has found a wealth of new applications in machine learning models during the past years. The related supermodular maximization models (submodular minimization) also offer an abundance of applications, but…
Submodular setfunctions play an important role in potential theory, and a perhaps even more important role in combinatorial optimization. The analytic line of research goes back to the work of Choquet; the combinatorial, to the work of Rado…
Objective of this paper is to introduce a new type of calculus which will be called G-Calculus based on non-Newtonian calculus introduced by Grossman and Katz \cite{GrossmanKatz}. The basic difference between geometric calculus defined by…
We investigate infinite dimensional modules for a linear algebraic group $\mathbb G$ over a field of positive characteristic $p$. For any subcoalgebra $C \subset \mathcal O(\mathbb G)$ of the coordinate algebra of $\mathbb G$, we consider…
For a set $M$ of $m$ elements, we define a decreasing chain of classes of normalized monotone-increasing valuation functions from $2^M$ to $\mathbb{R}_{\geq 0}$, parameterized by an integer $q \in [2,m]$. For a given $q$, we refer to the…
Many classical problems in theoretical computer science involve norm, even if implicitly; for example, both XOS functions and downward-closed sets are equivalent to some norms. The last decade has seen a lot of interest in designing…
Let $X$ be an algebraic variety, $f$ a regular function, $j:U\subset X$ the complement to the locus of vanishing of $f$, and $M$ a holonomic D-module on $U$. Consider the $D_U[s]$-module $M\otimes "f^s"$. The goal of this note is to…
A general theory of vector-valued modular functions, holomorphic in the upper half-plane, is presented for finite dimensional representations of the modular group. This also provides a description of vector-valued modular forms of arbitrary…
The bialgebraic abstract GSOS framework by Turi and Plotkin provides an elegant categorical approach to modelling the operational and denotational semantics of programming and process languages. In abstract GSOS, bisimilarity is always a…
Greedy algorithms are widely used for problems in machine learning such as feature selection and set function optimization. Unfortunately, for large datasets, the running time of even greedy algorithms can be quite high. This is because for…
A wide range of graph embedding objectives decompose into two components: one that enforces similarity, attracting the embeddings of nodes that are perceived as similar, and another that enforces dissimilarity, repelling the embeddings of…
Objects dual to graded algebras are subproduct systems of linear spaces, a purely algebraic counterpart of a notion introduced recently in the context of noncommutative dynamics (Shalit and Solel, Bhat and Mukherjee). A complete…
Ultrafunctions are a particular class of functions defined on a Non Archimedean field R^{*}\supset R. They have been introduced and studied in some previous works ([1],[2],[3]). In this paper we introduce a modified notion of ultrafunction…
Submodular functions have found a wealth of new applications in data science and machine learning models in recent years. This has been coupled with many algorithmic advances in the area of submodular optimization: (SO) $\min/\max~f(S): S…
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of convex functions, and can be minimized in strongly polynomial…
We consider the problem of maximizing non-negative non-decreasing set functions. Although most of the recent work focus on exploiting submodularity, it turns out that several objectives we encounter in practice are not submodular.…
Let V(KG) be a normalised unit group of the modular group algebra of a finite p-group G over the field K of p elements. We introduce a notion of symmetric subgroups in V(KG) as subgroups invariant under the action of the classical…
This paper introduces an assignment model with concave costs of skill gaps, which arise generally when firms mitigate costs of mismatch as in Stigler (1939) and Laffont and Tirole (1986, 1991). Concave costs of skill gaps imply that the…
Recently, many researchers devoted their attention to study the extensions of the gamma and beta functions. In the present work, we focus on investigating some approximations for a class of Gauss hypergeometric functions by exploiting…