Paper proposes a new method to evaluate joint risk under uncertainty.
problem Evaluating joint risk of multiple insurance risks under dependence uncertainty.
method Axiomatic approach to scalar and vector-valued distortion joint risk measures.
result Established a new scalar distortion joint risk measure with positive homogeneity.
Abstract: Generalizes multisymplectic forms to vector-valued versions.
problem Generalizing multisymplectic forms to vector-valued versions.
method Obtained a standard local presentation and proved an entropy inequality for partial compositions.
result Vector-valued multisymplectic forms form a non-unital operad.
The paper extends consistency results for sequential design strategies to vector-valued Gaussian processes.
problem Estimating excursion sets of vector-valued Gaussian processes.
method Clarifying the connection between continuous Gaussian processes and Gaussian measures in Banach spaces, extending concepts and properties from scalar-valued settings to vector-valued settings.
result Consistency results for sequential design strategies can be applied to vector-valued Gaussian processes.
We discuss sharp Sobolev inequalities for vector valued maps.
Motivated by multi-task machine learning with Banach spaces, we propose the notion of vector-valued reproducing kernel Banach spaces (RKBS). Basic properties of the spaces and the associated reproducing kernels are investigated. We also present feature map constructions and several concrete examples of vector-valued RK…
Optimal rates for vector-valued regression on various norms.
problem Optimal rates for vector-valued ridge regression on continuous norms.
method Combining standard capacity assumptions with tensor product constructions of vector-valued interpolation spaces.
result Optimal rates for vector-valued ridge regression, independent of output space dimension.
SL(n) covariant valuations on Orlicz spaces are represented and characterized.
problem Representing SL(n) covariant valuations on Orlicz spaces.
method Representation theorem established for continuous, SL(n) covariant vector-valued valuations.
result Unique characterization of SL(n) covariant valuations as moment vectors.
Boosting framework for vector-valued prediction with geometric stability.
problem Lack of a general theoretical understanding of aggregation for structured prediction.
method Identifies (α,β)-stability property and proposes a boosting framework based on exponential reweighting and geometric-median aggregation. result Obtains exponential decay of empirical divergence error under weak learner condition and (α,β)-stability. Study confirms learning rates for vector-valued spectral algorithms, proving consistency.
problem Theoretical confirmation of learning rates for vector-valued spectral algorithms.
method Rigorous analysis of learning rates for various vector-valued spectral algorithms, including kernel ridge regression and gradient descent.
result Upper and lower bounds on learning rates for vector-valued spectral algorithms, proving minimax optimality in various scenarios.
The space of vector-valued forms on any manifold is a graded Lie algebra with respect to the Frolicher-Nijenhuis bracket. In this paper we consider multiplicative vector-valued forms on Lie groupoids and show that they naturally form a graded Lie subalgebra. Along the way, we discuss various examples and different char…
Global watermark for diffusion language models decouples detection from local contexts.
problem Watermarking in diffusion language models is challenging due to joint sampling of distributions over many unresolved positions.
method Proposes a global vector-valued sketch representation to control watermarking in masked diffusion language models.
result The method decouples detection from local contexts, resulting in an order-agnostic statistic and robustness.
Vector-valued learning, where the output space admits a vector-valued structure, is an important problem that covers a broad family of important domains, e.g. multi-task learning and transfer learning. Using local Rademacher complexity and unlabeled data, we derive novel semi-supervised excess risk bounds for general v…
The paper shows vector-valued risk measures ignore dependence structures.
problem Defining capital allocation rules for random vectors with dependence.
method Defined vector-valued risk measures by axioms and showed their properties.
result Vector-valued risk measures ignore dependence structures, unlike set-valued measures.
The paper proposes methods to find a shared active subspace for multivariate vector-valued functions.
problem Minimizing the deviation between function evaluations in the original and reconstructed spaces.
method Manipulating gradients or SPD matrices to identify a shared structure.
result Summing SPD matrices often identifies the best shared active subspace.
Optimal transport for vector Gaussian mixtures improves efficiency and structure preservation.
problem Optimal mass transport for vector-valued Gaussian mixtures.
method Vectorizing Gaussian mixture models and studying optimal mass transport problems.
result Computational efficiency and structure preservation in optimal mass transport.
We present a framework to derive risk bounds for vector-valued learning with a broad class of feature maps and loss functions. Multi-task learning and one-vs-all multi-category learning are treated as examples. We discuss in detail vector-valued functions with one hidden layer, and demonstrate that the conditions under…
Study improves self-normalized bounds for vector-valued processes beyond sub-Gaussianity.
problem Limited understanding of self-normalized concentration for vector-valued processes outside sub-Gaussian frameworks.
method Developed concentration inequalities for self-normalized processes with light tails (e.g., Bennett, Bernstein bounds) for vector-valued data.
result Provided new insights and bounds for self-normalized processes with non-sub-Gaussian distributions.
We approximate derivatives of functions on manifolds by embedding them and applying vector-valued operators.
problem Derivatives of manifold-valued functions are harder to approximate than vector-valued functions.
method Embed the manifold into a higher space, approximate the derivative of the vector-valued function, and project back.
result We provide error bounds for the approximation of manifold-valued function derivatives.
Paper introduces vector-valued variation spaces for multi-output neural networks.
problem Understanding and optimizing multi-output neural networks.
method Development of vector-valued variation spaces and representer theorem.
result Novel bounds for layer widths in deep networks and a convex optimization method for compression.
Paper analyzes error bounds for learning with vector-valued RF, improving existing analyses.
problem Learning with vector-valued random features in infinite-dimensional settings.
method Direct analysis of risk functional, avoiding random matrix theory.
result Strong consistency and minimax optimal convergence rates established.
Randomized algorithm solves vector-valued regression problems with low-rank operators.
problem Vector-valued regression problems involving infinite-dimensional spaces.
method Randomized Reduced Rank Regression (R4) using Gaussian sketching for optimization.
result R4 estimators are efficient and accurate, with empirical risk close to optimal.
In this paper we find solutions uε to a certain class of vector-valued parabolic Allen-Cahn equation that as ε→0 develops as interface a given triod evolving under curve shortening flow.
Develops vector-valued RKBS for neural networks and operators.
problem Understanding function spaces of Rd-valued neural networks and neural operators. method Defines and constructs vector-valued RKBS (vv-RKBS) without restrictive assumptions.
result Establishes Representer Theorem for neural architectures.
Paper develops a theory for Patterson-Sullivan measures in higher rank symmetric spaces.
problem Establishing existence and uniqueness of Patterson-Sullivan measures in higher rank symmetric spaces.
method Develops theory for vector-valued horofunction boundaries and shadows.
result Proves existence and uniqueness of Patterson-Sullivan measures for transverse groups.
New method transfers emotions in facial images.
problem Transforming facial images to different emotions.
method Infinite task learning and vector-valued reproducing kernel Hilbert spaces.
result Achieves low reconstruction cost and high emotion classification accuracy.
In this study, we propose a new definition of multivariate conditional value-at-risk (MCVaR) as a set of vectors for discrete probability spaces. We explore the properties of the vector-valued MCVaR (VMCVaR) and show the advantages of VMCVaR over the existing definitions given for continuous random variables when adapt…
Vertex distortion detects if a knot is unknot.
problem Determining if a knot is the unknot.
method Using Denne-Sullivan's bound on Gromov distortion, the vertex distortion of nontrivial lattice knots is bounded. Then, it is shown that trivial vertex distortion implies the unknot.
result The conjecture that trivial vertex distortion implies the unknot is proven.
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.
This work studies the denoising of piecewise smooth graph signals that exhibit inhomogeneous levels of smoothness over a graph, where the value at each node can be vector-valued. We extend the graph trend filtering framework to denoising vector-valued graph signals with a family of non-convex regularizers, which exhibi…
Consider vector valued harmonic maps of at most linear growth, defined on a complete non-compact Riemannian manifold with non-negative Ricci curvature. For the norm square of the pull-back of the target volume form by such maps, we report a strong maximum principle, and equalities among its supremum, its asymptotic ave…
Framework for transferring discount curve estimates across fixed-income product classes.
problem Challenges in estimating discount curves from sparse or noisy data.
method Proposes a vector-valued kernel ridge regression (KR) framework with economic regularization.
result Transfer learning tightens confidence intervals and improves extrapolation performance.
Algorithm finds optimal affine transformation to minimize overall distortion.
problem Minimizing distortion in affine transformations.
method Riemannian geometry approach to define and minimize distortion.
result Mean distorting transformation found for minimizing overall distortion.
Vertex distortion measures how far lattice knots deviate from straight lines.
problem Measuring how much lattice knots deviate from straight paths.
method Analogous to smooth knots, study vertex distortion in lattice knots.
result Vertex distortion is 1 only for the unknot and can be arbitrarily high.
We consider the problem of distortion minimal morphing of n-dimensional compact connected oriented smooth manifolds without boundary embedded in Rn+1. Distortion involves bending and stretching. In this paper, minimal distortion (with respect to stretching) is defined as the infinitesimal relative change in vol…
This paper shows how to calculate risk measures for sums of two counter-monotonic risks.
problem Calculating risk measures for sums of two counter-monotonic risks.
method Using a fixed distortion function and expressing the risk measure of a sum as the sum of two related measures of the marginals.
result The risk measure of a sum of two counter-monotonic risks can be expressed as the sum of two related distortion risk measures of the marginals.
As in a symmetric space of noncompact type, one can associate to an oriented geodesic segment in a Euclidean building a vector valued length in the Euclidean Weyl chamber; in addition to the metric length it contains information on the direction of the segment. We study in this paper restrictions on the vector valued s…
Most distortion correction methods focus on simple forms of distortion, such as radial or linear distortions. These works undistort images either based on measurements in the presence of a calibration grid, or use multiple views to find point correspondences and predict distortion parameters. When possible distortions …
Completes the space of vector-valued one-forms on manifolds.
problem Metric incompleteness of the space of full-ranked one-forms.
method Distance equality and quotient structures.
result Concrete description of the metric completion of the space of full-ranked one-forms.
Study distortion risk measures for step-weighted distributions.
problem Analyzing risk measures for specific distribution types.
method Investigate distortion risk measures of step-weighted distributions.
result Developed methods for calculating risk measures.
The distortion of a curve measures the maximum arc/chord length ratio. Gromov showed any closed curve has distortion at least pi/2 and asked about the distortion of knots. Here, we prove that any nontrivial tame knot has distortion at least 5pi/3; examples show that distortion under 7.16 suffices to build a trefoil kno…
Computed distortion coefficients for the α-Grushin plane.
problem Analyzing the distortion coefficients of the α-Grushin plane.
method Using generalised trigonometric functions and synthetic curvature conditions.
result Estimates for distortion coefficients and a curvature condition conjecture.
Study on risk measures using distorted Choquet integrals with random distortions.
problem Developing risk measures under random distortions of capacities.
method Introducing and analyzing randomly distorted Choquet integrals with respect to a distorted capacity, establishing properties and providing representations.
result Representation of comonotonic additive conditional risk measures using G-randomly distorted Choquet integrals.
Extends Morse-Forman theory to vector-valued functions for multiparameter persistence.
problem Computing multiparameter persistence with new tools and methods.
method Adapting Forman's theory to vectorial setting and using combinatorial topological dynamics.
result Established more general result for sublevel sets and found a way to induce Morse decomposition.
The classical Schläfli formula, and its ``higher'' analogs given in [SS03], are relations between the variations of the volumes and ``curvatures'' of faces of different dimensions of a polyhedra (which can be Euclidean, spherical or hyperbolic) under a first-order deformation. We describe here analogs of those formulas…
We study a generalized family of stochastic orders, semiparametrized by a distortion function H, namely H-distorted stochastic dominance, which may determine a continuum of dominance relations from the first- to the second-order stochastic dominance (and beyond). Such a family is especially suitable for representing a …
A market model with d assets in discrete time is considered where trades are subject to proportional transaction costs given via bid-ask spreads, while the existence of a numèraire is not assumed. It is shown that robust no arbitrage holds if, and only if, there exists a Pareto solution for some vector-valued utility…
We examine the relationship between nonabelian Hodge theory for Riemann surfaces and the theory of vector valued modular forms. In particular, we explain how one might use this relationship to prove a conjectural three-term inequality on the weights of free bases of vector valued modular forms associated to complex, fi…
We show that an entire branched cover of finite distortion cannot have a compact branch set if its distortion satisfies a certain asymptotic growth condition. We furthermore show that this bound is strict by constructing an entire, continuous, open and discrete mapping of finite distortion which is piecewise smooth, ha…