相关论文: Coherent and Archimedean choice in general Banach …

In this paper, we embed metric space endowed with a convex combination operation, named convex combination space, into a Banach space and the embedding preserves the structures of metric and convex combination. For random element taking…

A new approach to inference in state space models is proposed, based on approximate Bayesian computation (ABC). ABC avoids evaluation of the likelihood function by matching observed summary statistics with statistics computed from data…

The anchor words algorithm performs provably efficient topic model inference by finding an approximate convex hull in a high-dimensional word co-occurrence space. However, the existing greedy algorithm often selects poor anchor words,…

Designing models that are both expressive and preserve known invariances of tasks is an increasingly hard problem. Existing solutions tradeoff invariance for computational or memory resources. In this work, we show how to leverage…

We consider a school choice matching model where the priorities for schools are represented by binary relations that may not be weak order. We focus on the (total order) extensions of the binary relations. We introduce a class of algorithms…

In this paper we describe the surjective linear isometries on a vector valued little Bloch space with range space a strictly convex and smooth complex Banach space. We also describe the hermitian operators and the generalized bi-circular…

In this paper, we consider a model of classical linear logic based on coherence spaces endowed with a notion of totality. If we restrict ourselves to total objects, each coherence space can be regarded as a uniform space and each linear map…

Almost all representations considered in computable analysis are partial. We provide arguments in favor of total representations (by elements of the Baire space). Total representations make the well known analogy between numberings and…

Intransitivity is a critical issue in pairwise preference modeling. It refers to the intransitive pairwise preferences between a group of players or objects that potentially form a cyclic preference chain and has been long discussed in…

The representability theorem for stacks, due to Artin in the underived setting and Lurie in the derived setting, gives conditions under which a stack is representable by an $n$-geometric stack. In recent work of Ben-Bassat, Kelly, and…

Multicriteria decision analysis aims at supporting a person facing a decision problem involving conflicting criteria. We consider an additive utility model which provides robust conclusions based on preferences elicited from the decision…

We study bilinear embedding models for the task of multi-relational link prediction and knowledge graph completion. Bilinear models belong to the most basic models for this task, they are comparably efficient to train and use, and they can…

Results of a previous paper [Commun. Contemp. Math., 09 (2007) 217-251] on the existence of solutions to a nonlinear evolution equation in an abstract Lebesgue space, arising from kinetic theory, are re-obtained in the more general setting…

Comparing competing mathematical models of complex natural processes is a shared goal among many branches of science. The Bayesian probabilistic framework offers a principled way to perform model comparison and extract useful metrics for…

We prove that any correspondence (multi-function) mapping a metric space into a Banach space that satisfies a certain pointwise Lipschitz condition, always has a continuous selection that is pointwise Lipschitz on a dense set of its domain.…

The deepest arithmetic invariants attached to an algebraic variety defined over a number field $F$ are conjecturally captured by the integral part of its motivic cohomology. There are essentially two ways of defining it when $X$ is a smooth…

We study social welfare of learning outcomes in mechanisms with admission. In our repeated game there are $n$ bidders and $m$ mechanisms, and in each round each mechanism is available for each bidder only with a certain probability. Our…

We consider selective classification with abstention in the fixed-pool (or transductive) setting, where the unlabeled pool is given beforehand and only a subset of points can be queried for labels. Our main insight is to view selective…

Constructing or learning a function from a finite number of sampled data points (measurements) is a fundamental problem in science and engineering. This is often formulated as a minimum norm interpolation problem, regularized learning…

A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…