Study on identifying most preferred policy in bandits with vector-valued rewards.
problem Identifying the most preferred policy in bandits with vector-valued rewards.
method Derive a novel lower bound on sample complexity, design the Preference-based Track and Stop (PreTS) algorithm, and derive a new concentration inequality.
result The sample complexity of PreTS is asymptotically tight.
Constructs currents and heights on K3 surfaces.
problem Understanding the geometry and arithmetic of K3 surfaces.
method Constructs canonical positive currents and heights on K3 surfaces, equivariant for automorphism group.
result Continuous family of currents and heights defined over an enlarged boundary of the ample cone.
FraPPE efficiently identifies Pareto optimal arms in multi-objective bandits.
problem Efficiently identifying Pareto optimal arms in multi-objective bandits with confidence.
method Deriving structural properties and using Frank-Wolfe optimisation to solve the maxmin optimisation problem.
result FraPPE achieves optimal sample complexity and identifies the exact Pareto set.
Study finds equivalence between MMV and MV preferences with conic constraints.
problem Monotone mean-variance portfolio selection under conic constraints.
method Closed-form solutions for optimal strategies under MMV and MV preferences.
result Optimal strategies coincide with and without the conic constraint.
A new policy for contextual bandits adapts to reward vector shifts.
problem Learning under reward vector shifts with ordered rewards.
method Adaptive-discretization and optimistic elimination policy.
result Established upper bounds on preference-based regret.
We consider an economy where agents' consumption sets are given by the cone L+0 of non-negative measurable functions and whose preferences are defined by additive utilities satisfying the Inada conditions. We extend to this setting the results in \citet{Dana:93} on the existence and uniqueness of Arrow-Deb…
New method for identifying best designs in vector optimization with uncertain feedback.
problem Optimizing vector-valued outcomes with uncertain preferences.
method Stochastic bandit feedback, polyhedral ordering cone, (ε,δ)-PAC Pareto set identification. result Sample complexity characterized and matched by the naïve elimination algorithm.
This paper attempts to define a generalisation of the standard Einstein condition (in conformal/metric geometry) to any parabolic geometry. To do so, it shows that any preserved involution σ of the adjoint bundle $\mc{A}$ gives rise, given certain algebraic conditions, to a unique preferred affine connection ∇…
Abstract: Generalizes stability theories over toric varieties and Novikov type rings.
problem Stability theories over toric varieties and Novikov type base.
method Generalization of stability theories to families over toric varieties and their analytic analogues.
result Established properness of moduli of Calabi-Yau cones and Kahler-Ricci solitons.
The purpose of this paper is to study harmonic spinors defined on a 1-parameter family of Einstein manifolds which includes Taub-NUT, Eguchi-Hanson and P2(C) with the Fubini-Study metric as particular cases. We discuss the existence of and explicitly solve for spinors harmonic with respect to the Dirac operator twis…
Introduces holed cone structures to generalize cone structures on 3-manifolds.
problem Generalizing cone structures to 3-manifolds with irreducible holonomy representations.
method Introduces holed cone structures and considers their deformation space.
result The deformation space of holed cone structures is a covering space of the character variety.
Unique cylindrical tangent cone for Simons' hypersurface found.
problem Uniqueness of cylindrical tangent cones for area-minimizing hypersurfaces.
method Developed a new Lojasiewicz inequality for non-isolated singularities.
result Cylindrical tangent cone for Simons' hypersurface is unique.
This is a continuation of the previous articles on Kahler cone metrics. In this article, we introduce weighted function spaces and provide a self-contained treatment on cone angles in the whole interval (0,1]. We first construct geodesics in the space of Kahler cone metrics (cone geodesics). We next determine the ver…
Given a closed orientable Euclidean cone 3-manifold C with cone angles less than or equal to pi, and which is not almost product, we describe the space of constant curvature cone structures on C with cone angles less than pi. We establish a regeneration result for such Euclidean cone manifolds into spherical or hyperbo…
Study strict stability of cones with isolated singularities.
problem Stability of cones with isolated singularities.
method Analyzes special Lagrangian and coassociative cones, provides examples for the complex case.
result Proves strict stability for special Lagrangian and coassociative cones.
Optimizes molecular generation for chemist preferences.
problem Models lack inherent preferences for chemist-desired structures.
method Fine-tuning with Direct Preference Optimization.
result Approach is simple, efficient, and highly effective.
For 3-dimensional hyperbolic cone structures with cone angles θ, local rigidity is known for 0≤θ≤2π, but global rigidity is known only for 0≤θ≤π. The proof of the global rigidity by Kojima is based on the fact that hyperbolic cone structures with cone angles at most π do not degenerate in defo…
Weiss and, independently, Mazzeo and Montcouquiol recently proved that a 3--dimensional hyperbolic cone-manifold (possibly with vertices) with all cone angles less than 2π is infinitesimally rigid. On the other hand, Casson provided 1998 an example of an infinitesimally flexible cone-manifold with some of the cone an…
The study finds billiard trajectories with infinitely many reflections in certain cones.
problem Existence of billiard trajectories with infinitely many reflections.
method Analysis of C3 convex cones and elliptic cones in R3. result Existence of C2 convex cones with billiard trajectories having infinitely many reflections. New method adapts to user preferences dynamically, improving recommendation models.
problem Current recommendation models lack dynamic adaptation to changing user preferences.
method Preference Discerning with LLM-Enhanced Generative Retrieval
result Mender achieves state-of-the-art performance in adapting to evolving user preferences.
The SCMU algorithm computes cone factorizations for symmetric cones, improving upon existing methods.
problem Computing cone factorizations for symmetric cones in optimization.
method Introduces and analyzes the symmetric-cone multiplicative update (SCMU) algorithm.
result The SCMU algorithm non-decreases the squared loss objective.
We describe some properties of noncompact Euclidean cone manifolds with cone angles less than c less than 2pi and singular locus a submanifold. More precisely, we describe its structure outside a compact set. As a corollary we classify those with cone angles less than 3pi/2 and those with all cone angles equal to 3pi/2…
We prove that every closed oriented 3-manifold admits a hyperbolic cone-manifold structure with cone-angle arbitrarily close to 2pi.
Many real-world engineering problems rely on human preferences to guide their design and optimization. We present PrefOpt, an open source package to simplify sequential optimization tasks that incorporate human preference feedback. Our approach extends an existing latent variable model for binary preferences to allow f…
Enhances preference learning by incorporating response times into binary choices.
problem Limited information from binary choices about preference strength.
method Combines choices and response times using the EZ diffusion model.
result Response times improve utility estimation for strong preferences.
Bayesian optimization learns DM preferences for multi-outcome experiments.
problem Optimizing expensive experiments with unknown utility functions and multiple outcomes.
method Alternates preference learning and Bayesian optimization, using pairwise comparisons.
result Preference exploration strategies improve Bayesian optimization performance.
New Calabi-Yau metrics with conical singularities are created near complex lines.
problem Creating Calabi-Yau metrics with conical singularities near complex lines.
method Using branched covering arguments to construct metrics with conical singularities.
result Calabi-Yau metrics with unstable conical singularities are successfully created.
New study shows personalized content recommendations can lead to polarization of user preferences.
problem Personalized content recommendations can alter user preferences, leading to polarization.
method Used a model of preference dynamics to explore how personalized content affects user preferences.
result Standard reward maximization algorithms achieve only constant regret in personalized recommendation environments.
Optimal family of Calabi-Yau cone metrics found for toric Kähler cones.
problem Finding metrics for toric Kähler cones with conical singularities.
method Parametrized family of Calabi-Yau cone metrics with conical singularities.
result Any toric Calabi-Yau cone metric with conical singularities belongs to this optimal family.
The Lee-Gauduchon cone is a convex cone of cohomology classes for complex manifolds.
problem Understanding the Lee-Gauduchon cone for complex manifolds.
method Analyzing the Lee-Gauduchon cone as a convex cone of cohomology classes.
result The Lee-Gauduchon cone is a bimeromorphic invariant.
Lower bounds on cone density for nontrivial complements in low dimensions.
problem Finding density limits for minimal cones with nontrivial complements.
method Proving lower bounds on cone density for cones of dimensions less than seven with nontrivial complements.
result Established lower bounds on cone density for minimal cones with nontrivial complements in dimensions less than seven.
Criterion for surfaces in Heisenberg group to be graphs using flat cones.
problem Characterizing surfaces in Heisenberg group as graphs.
method Using planar cones to define intrinsic rectifiability.
result Criterion for topological surfaces to be intrinsic Lipschitz graphs.
Bayesian optimization agent learns user preferences from pairwise comparisons.
problem Learning user preferences from unknown and infinite choices.
method Sequential Bayesian optimization with pairwise comparisons.
result Optimal agent strategy minimizes remaining system uncertainty.
New RLHF framework handles general preference oracles without reward functions.
problem Handling general preference oracles without assuming a reward function.
method Developed a minimax game between two LLMs for RLHF under a general preference oracle, focusing on KL-regularized preference.
result Proposed algorithms for efficient offline and online RLHF learning.
The study of limit cones for multi-Fuchsian representations in (PSL2R)d.
problem Characterizing the structure of limit cones for multi-Fuchsian representations.
method Analysis of normalized multi-lengths and convex cones in R≥0d. result Different regimes of limit cones exist, with some having finite sides and others dense extremal rays.
This paper studies robust forward investment and consumption preferences within a zero-volatility context. Different from previous works, we consider an incomplete financial market model due to general investment portfolio constraints. We provide a new PDE characterization and a novel semi-explicit saddle-point constru…
We prove 3-dimensional hyperbolic cone-manifolds are geometrically inflexible: a cone-deformation of a hyperbolic cone-manifold determines a bi-Lipschitz diffeomorphism between initial and terminal manifolds in the deformation in the complement of a standard tubular neighborhood of the cone-locus whose pointwise bi-Lip…
We investigate subgroups of SL (n,Z) which preserve an open nondegenerate convex cone in real n-space and admit in that cone as fundamental domain a polyhedral cone of which some faces are allowed to lie on the boundary. Examples are arithmetic groups acting on selfdual cones, Weyl groups of certain Kac-Moody algebras …
Given a geometrically finite hyperbolic cone-manifold, with the cone singularity sufficiently short, we construct a one parameter family of cone-manifolds decreasing the cone angle to zero. We also control the geometry of this one parameter family via the Schwarzian derivative of the projective boundary and the length …
Study connects contact structures to cone geodesics and contactomorphisms.
problem Understanding contact structures on cone geodesics.
method Review and generalize cone geodesics to contact manifolds, establish correspondence with contactomorphisms.
result Established correspondence between contactomorphisms and cone structures.
By a classical theorem of Gallot (1979), a Riemannian cone over a complete Riemannian manifold is either flat or has irreducible holonomy. We consider metric cones with reducible holonomy over pseudo-Riemannian manifolds. First we describe the local structure of the base of the cone when the holonomy of the cone is dec…
Analytic sets with unique infinite tangent cone are algebraic.
problem Characterizing analytic sets with unique infinite tangent cones.
method Analytic and algebraic set properties, degree of complex algebraic sets.
result Degree of Lipschitz normally embedded sets equals their infinite tangent cone degree.
Researchers prove uniqueness of certain cylindrical tangent cones for special Lagrangians.
problem Proving uniqueness of cylindrical tangent cones for special Lagrangians.
method Analyzing exact special Lagrangian submanifolds with multiplicity one and cylindrical tangent cones.
result The cylindrical tangent cones are unique under specific conditions.
In preference-based reinforcement learning (RL), an agent interacts with the environment while receiving preferences instead of absolute feedback. While there is increasing research activity in preference-based RL, the design of formal frameworks that admit tractable theoretical analysis remains an open challenge. Buil…
We study special Lagrangian cones in $\C^n$ with isolated singularities. Our main result constructs an infinite family of special Lagrangian cones in $\C^3$ each of which has a toroidal link. We obtain a detailed geometric description of these tori. We prove a regularity result for special Lagrangian cones in $\C^3$ wi…
Researchers describe a new Thom form for mapping cones.
problem Developing a new Thom form for mapping cones.
method Using the mapping cone covariant derivative and Berezin integral, they explicitly write down the Thom form.
result The Thom form is closed with respect to the mapping cone differentiation, integrates to 1 along the fiber, and satisfies the transgression formula.
Uniqueness proven for cylindrical tangent cones in high dimensions.
problem Proving uniqueness of cylindrical tangent cones in high dimensions.
method Analyzing area-minimizing hypersurfaces in R^9.
result Uniqueness of cylindrical tangent cones Cp,qimesR in R9. Find limiting sets for digital cones and suspensions.
problem Digital topology cone and suspension constructions.
method Identify (m, n)-limiting sets, especially (0, 0)-freezing sets.
result Discover (0, 0)-limiting sets for digital cones and suspensions.