Spherical Preferences
We introduce and study the property of orthogonal independence, a restricted additivity axiom applying when alternatives are orthogonal. The axiom requires that the preference for one marginal change over another should be maintained after each marginal change has been shifted in a direction that is orthogonal to both. We show that continuous preferences satisfy orthogonal independence if and only if they are spherical: their indifference curves are spheres with the same center, with preference being "monotone" either away or towards the center. Spherical preferences include linear preferences as a special (limiting) case. We discuss different applications to economic and political environments. Our result delivers Euclidean preferences in models of spatial voting, quadratic welfare aggregation in social choice, and expected utility in models of choice under uncertainty.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Multi-Facet Recommender Networks with Spherical Optimization
Implicit feedback is widely explored by modern recommender systems. Since the feedback is often sparse and imbalanced, it poses great challenges to the learning of complex interactions among users and items. Metric learn…
Metric LearningRecommendation SystemsRepresentation LearningUniversal Feature Selection with Noisy Observations and Weak Symmetry Conditions
This paper relaxes the restrictive symmetry conditions adopted in [4], [5] and extends their universal feature selection framework to accommodate noisy observations as well as attribute structures that may exhibit direct…
Orthogonal Finetuning for Direct Preference Optimization
DPO is an effective preference optimization algorithm. However, the DPO-tuned models tend to overfit on the dispreferred samples, manifested as overly long generations lacking diversity. While recent regularization appro…
DiversitySpherical Space Domain Adaptation With Robust Pseudo-Label Loss
Adversarial domain adaptation (DA) has been an effective approach for learning domain-invariant features by adversarial training. In this paper, we propose a novel adversarial DA approach completely defined in spherical …
Domain AdaptationPseudo LabelSpherical Feature Pyramid Networks For Semantic Segmentation
Semantic segmentation for spherical data is a challenging problem in machine learning since conventional planar approaches require projecting the spherical image to the Euclidean plane. Representing the signal on a funda…
Image SegmentationSegmentationSemantic Segmentation