Related papers: Are Gross Substitutes a Substitute for Submodular …

Superposition rules form a class of functions that describe general solutions of systems of first-order ordinary differential equations in terms of generic families of particular solutions and certain constants. In this work we extend this…

Neural operators (NOs) are a class of deep learning models designed to simultaneously solve infinitely many related problems by casting them into an infinite-dimensional space, whereon these NOs operate. A significant gap remains between…

This paper proposes an original exchange property of valuations.This property is shown to be equivalent to a property described by Dress and Terhalle in the context of discrete optimization and matroids and shown there to characterize the…

In a recent paper, Rose proves that certain generalized sum-of-divisor functions are quasi-modular forms for some congruence subgroup and conjectures that these forms are quasi-modular for $\Gamma_1(n)$. Here, we prove this conjecture.

A surprising property of word vectors is that word analogies can often be solved with vector arithmetic. However, it is unclear why arithmetic operators correspond to non-linear embedding models such as skip-gram with negative sampling…

Subsequence matching has appeared to be an ideal approach for solving many problems related to the fields of data mining and similarity retrieval. It has been shown that almost any data class (audio, image, biometrics, signals) is or can be…

We study the problem of a budget limited buyer who wants to buy a set of items, each from a different seller, to maximize her value. The budget feasible mechanism design problem aims to design a mechanism which incentivizes the sellers to…

Due to their flexibility, Gaussian processes (GPs) have been widely used in nonparametric function estimation. A prior information about the underlying function is often available. For instance, the physical system (computer model output)…

We study the approximability of EFX allocations for indivisible chores under complement-free cost functions. The non-existence of exact EFX allocations for general monotone functions for chores is known from \cite{CS24}, and a result of…

Let G be any of the complex classical groups GL(n), SO(2n+1), Sp(2n), O(2n), let g denote the Lie algebra of G, and let Z(g) denote the subalgebra of G-invariants in the universal enveloping algebra U(g). We derive a Taylor-type expansion…

Pandora's problem is a fundamental model in economics that studies optimal search strategies under costly inspection. In this paper we initiate the study of Pandora's problem with combinatorial costs, capturing many real-life scenarios…

Many real-world datasets can be represented in the form of a graph whose edge weights designate similarities between instances. A discrete Gaussian random field (GRF) model is a finite-dimensional Gaussian process (GP) whose prior…

Generalized Functions play a central role in the understanding of differential equations containing singularities and nonlinearities. Introducing infinitesimals and infinities to deal with these obstructions leads to controversies…

In many naturally occurring optimization problems one needs to ensure that the definition of the optimization problem lends itself to solutions that are tractable to compute. In cases where exact solutions cannot be computed tractably, it…

We investigate analogs of symmetric functions arising from an extension of the nilHecke algebra defined by Naisse and Vaz. These extended symmetric functions form a subalgebra of the polynomial ring tensored with an exterior algebra. We…

We show that for any constant $\epsilon > 0$ and $p \ge 1$, it is possible to distinguish functions $f : \{0,1\}^n \to [0,1]$ that are submodular from those that are $\epsilon$-far from every submodular function in $\ell_p$ distance with a…

GROUSE (Grassmannian Rank-One Update Subspace Estimation) is an incremental algorithm for identifying a subspace of Rn from a sequence of vectors in this subspace, where only a subset of components of each vector is revealed at each…

Gradual semantics (GS) have demonstrated great potential in argumentation, in particular for deploying quantitative bipolar argumentation frameworks (QBAFs) in a number of real-world settings, from judgmental forecasting to explainable AI.…

Let $G$ be a finite abelian group and let $K$ be an algebraically closed field of characteristic 0. We consider associative unital algebras $A$ over $K$ graded by $G$, that is $A=\oplus_{g\in G} A_g$, where the vector subspaces $A_g$…

A fundamental task underlying many important optimization problems, from influence maximization to sensor placement to content recommendation, is to select the optimal group of $k$ items from a larger set. Submodularity has been very…