相关论文: Mathematics of Plott choice functions
Let $n \in \N$ and $M_n$ be the algebra of $n \times n$ matrices. We call a function $f$ matrix monotone of order $n$ or $n$-monotone in short whenever the inequality $f(a) \leq f(b)$ holds for every pair of selfadjoint matrices $a, b \in…
We analyze matrix convex functions of a fixed order defined on a real interval by differential methods as opposed to the characterization in terms of divided differences given by Kraus. We obtain for each order conditions for matrix…
In this paper we study different concepts of independence for convex sets of probabilities. There will be two basic ideas for independence. The first is irrelevance. Two variables are independent when a change on the knowledge about one…
We propose in this paper a general framework for deriving loss functions for structured prediction. In our framework, the user chooses a convex set including the output space and provides an oracle for projecting onto that set. Given that…
Lattice paths effectively model phenomena in chemistry, physics and probability theory. Asymptotic enumeration of lattice paths is linked with entropy in the physical systems being modeled. Lattice paths restricted to different regions of…
Spaces of convex and concave functions appear naturally in theory and applications. For example, convex regression and log-concave density estimation are important topics in nonparametric statistics. In stochastic portfolio theory, concave…
Given a strictly positive measure, we characterize inner semicontinuous solid convex-valued mappings for which continuous functions which are selections almost everywhere are selections. This class contains continuous mappings as well as…
In this paper we are concerned with understanding the nature of program metrics for calculi with higher-order types, seen as natural generalizations of program equivalences. Some of the metrics we are interested in are well-known, such as…
This paper is motivated by the desire to study package management using the toolkit of the semantics of functional languages. As it transpires, this is deeply related to the semantics of concurrent computation. The models we produce are not…
It is well known by analysts that a concept lattice has an exponential size in the data. Thus, as soon as he works with real data, the size of the concept lattice is a fundamental problem. In this chapter, we propose to investigate factor…
It is known that, in finite dimensions, the support function of a compact convex set with non empty interior is differentiable excepting the origin if and only if the set is strictly convex. In this paper we realize a thorough study of the…
Direct search is one of the most popular derivative-free optimization paradigms, that relies on exploring the variable space using polling directions. To analyze and implement direct search, one typically relies on positive spanning sets.…
We introduce certain lattice sums associated with hyperplane arrangements, which are (multiple) sums running over integers, and can be regarded as generalizations of certain linear combinations of zeta-functions of root systems. We also…
Probability functions appear in constraints of many optimization problems in practice and have become quite popular. Understanding their first-order properties has proven useful, not only theoretically but also in implementable algorithms,…
In this article we introduce theory and algorithms for learning discrete representations that take on a lattice that is embedded in an Euclidean space. Lattice representations possess an interesting combination of properties: a) they can be…
The paper studies a general scheme for constructing metrics on a product of metric spaces by means of a family of continuous convex functions. This construction includes the conventional $p$-metrics and generates metrics that are…
Trying to enumerate all of the walks in a 2D lattice is a fun combinatorial problem and there are numerous applications, from polymers to sports. Computers provide a wonderful tool for analyzing these walks; we provide a Maple package for…
We construct new families of direct serendipity and direct mixed finite elements on general planer convex polygons that are $H^1$ and $H(div)$ conforming, respectively, and possess optimal order of accuracy for any order. They have a…
We revisit the problem of existence of stable systems of contracts with arbitrary sets of contracts. We show that stable sets of contracts exists if choices of agents satisfy path-independence. We call such choice functions Plott functions.…
We consider the problem of learning to choose from a given set of objects, where each object is represented by a feature vector. Traditional approaches in choice modelling are mainly based on learning a latent, real-valued utility function,…