2,956 research outputs found
Construction of aggregation operators with noble reinforcement
This paper examines disjunctive aggregation operators used in various recommender systems. A specific requirement in these systems is the property of noble reinforcement: allowing a collection of high-valued arguments to reinforce each other while avoiding reinforcement of low-valued arguments. We present a new construction of Lipschitz-continuous aggregation operators with noble reinforcement property and its refinements. <br /
Monotonicity preserving approximation of multivariate scattered data
This paper describes a new method of monotone interpolation and smoothing of multivariate scattered data. It is based on the assumption that the function to be approximated is Lipschitz continuous. The method provides the optimal approximation in the worst case scenario and tight error bounds. Smoothing of noisy data subject to monotonicity constraints is converted into a quadratic programming problem. Estimation of the unknown Lipschitz constant from the data by sample splitting and cross-validation is described. Extension of the method for locally Lipschitz functions is presented.<br /
Equivalence between duality and gradient flow solutions for one-dimensional aggregation equations
Existence and uniqueness of global in time measure solution for a one
dimensional nonlinear aggregation equation is considered. Such a system can be
written as a conservation law with a velocity field computed through a
selfconsistant interaction potential. Blow up of regular solutions is now well
established for such system. In Carrillo et al. (Duke Math J (2011)), a theory
of existence and uniqueness based on the geometric approach of gradient flows
on Wasserstein space has been developped. We propose in this work to establish
the link between this approach and duality solutions. This latter concept of
solutions allows in particular to define a flow associated to the velocity
field. Then an existence and uniqueness theory for duality solutions is
developped in the spirit of James and Vauchelet (NoDEA (2013)). However, since
duality solutions are only known in one dimension, we restrict our study to the
one dimensional case
Characterizations of bivariate conic, extreme value, and Archimax copulas
Based on a general construction method by means of bivariate ultramodular copulas we construct, for particular settings, special bivariate conic, extreme value, and Archimax copulas. We also show that the sets of copulas obtained in this way are dense in the sets of all conic, extreme value, and Archimax copulas, respectively
Small gain theorems for large scale systems and construction of ISS Lyapunov functions
We consider interconnections of n nonlinear subsystems in the input-to-state
stability (ISS) framework. For each subsystem an ISS Lyapunov function is given
that treats the other subsystems as independent inputs. A gain matrix is used
to encode the mutual dependencies of the systems in the network. Under a small
gain assumption on the monotone operator induced by the gain matrix, a locally
Lipschitz continuous ISS Lyapunov function is obtained constructively for the
entire network by appropriately scaling the individual Lyapunov functions for
the subsystems. The results are obtained in a general formulation of ISS, the
cases of summation, maximization and separation with respect to external gains
are obtained as corollaries.Comment: provisionally accepted by SIAM Journal on Control and Optimizatio
Aggregation functions: Means
The two-parts state-of-art overview of aggregation theory summarizes the essential information concerning aggregation issues. Overview of aggregation properties is given, including the basic classification of aggregation functions. In this first part, the stress is put on means, i.e., averaging aggregation functions, both with fixed arity (n-ary means) and with open arity (extended means).
- …