An elementary proof shows submodular functions can be represented as measure suprema.
problem Representing submodular functions as supremum of measures.
method Elementary proof using standard extension theorem of measures.
result Submodular functions can be expressed as supremum of measures.
Transductive learning considers situations when a learner observes m labelled training points and u unlabelled test points with the final goal of giving correct answers for the test points. This paper introduces a new complexity measure for transductive learning called Permutational Rademacher Complexity (PRC) and …
Researchers develop a method to infer reference measures from observed functionals.
problem Tackles the challenge of identifying or recovering a reference measure from observed functionals.
method Uses the property of law-invariant functionals defining lower or upper supporting sets in dual spaces of signed measures.
result Illustrates the methodology with examples and develops a modification for Value-at-Risk.
New sparsification theorem for Gaussian processes reduces dimensionality.
problem Dimension-independent sparsification of Gaussian process suprema.
method Dimension-independent sparsification of Gaussian process suprema.
result Sparsifier size is independent of ∣T∣ and n. New findings on null measurability in symmetrization interface of VC learning.
problem Null measurability issues in symmetrization interface of VC learning.
method Formalized in Lean 4, using Choquet capacitability and patching properties.
result Null-measurable bad event not Borel measurable, separating regularity levels.
We study the convolutional phase retrieval problem, of recovering an unknown signal x∈Cn from m measurements consisting of the magnitude of its cyclic convolution with a given kernel a∈Cm. This model is motivated by applications such as channel estimation, optics, and u…
We propose a general framework for studying adaptive regret bounds in the online learning framework, including model selection bounds and data-dependent bounds. Given a data- or model-dependent bound we ask, "Does there exist some algorithm achieving this bound?" We show that modifications to recently introduced sequen…
From concentration inequalities for the suprema of Gaussian or Rademacher processes an inequality is derived. It is applied to sharpen existing and to derive novel bounds on the empirical Rademacher complexities of unit balls in various norms appearing in the context of structured sparsity and multitask dictionary lear…
Upper bound on expected supremum of Bernoulli process.
problem Bounding the supremum of Bernoulli processes.
method Using properties of the index set and function class, extending earlier results on Gaussian processes.
result An upper bound on the expected supremum of a Bernoulli process.
Develops non-standard analysis for coherent risk estimation.
problem Estimating coherent risk measures in financial contexts.
method Non-standard analysis, hyperfinite representations, discrete Kusuoka formulae, plug-in asymptotics.
result Uniform almost sure consistency and asymptotic normality of spectral plug-in estimators.
We show two novel concentration inequalities for suprema of empirical processes when sampling without replacement, which both take the variance of the functions into account. While these inequalities may potentially have broad applications in learning theory in general, we exemplify their significance by studying the t…
We prove a new and general concentration inequality for the excess risk in least-squares regression with random design and heteroscedastic noise. No specific structure is required on the model, except the existence of a suitable function that controls the local suprema of the empirical process. So far, only the case of…
We study superreplication of European contingent claims in discrete time in a large trader model with market indifference prices recently proposed by Bank and Kramkov. We introduce a suitable notion of efficient friction in this framework, adopting a terminology introduced by Kabanov, Rasonyi, and Stricker in the conte…
The paper offers efficient algorithms for combinatorial and linear bandits using empirical process theory.
problem Optimal algorithms for combinatorial and linear bandits with practical sample complexity.
method Empirical process theory, Gaussian-width, minimizing experimental design objective.
result Sample complexity matches lower bounds, especially for combinatorial classes.
Unified technique for sequential estimation of convex divergences.
problem Estimating convex divergences between distributions.
method Martingale methods and maximal inequalities for reverse submartingales.
result Valid time-uniform confidence sequences for arbitrary stopping times.
We study a sparse negative binomial regression (NBR) for count data by showing the non-asymptotic advantages of using the elastic-net estimator. Two types of oracle inequalities are derived for the NBR's elastic-net estimates by using the Compatibility Factor Condition and the Stabil Condition. The second type of oracl…
New experimental design minimizes regret in bandits.
problem Minimizing regret in online stochastic linear and combinatorial bandits.
method Experimental design-based algorithm balancing information gain and reward.
result State-of-the-art finite time regret guarantees and computational efficiency.
Unified bounds for sketched bilinear forms in machine learning and statistics.
problem Uniform bounds on sketched bilinear forms for modern analyses.
method Generic chaining and new techniques for handling suprema over pairs of sets.
result Improved convergence bounds for sketched Federated Learning and bandit algorithms.
Method estimates mixture components without discretizing parameters.
problem Learning from mixtures of continuous features with noise.
method Off-the-grid optimization method for continuous parameter space.
result Prediction error bound similar to Lasso predictor.
Estimates signals from a continuous dictionary with sparse mixtures using optimization.
problem Estimating signals from a continuous dictionary with unknown mixtures and noise.
method Formulates a regularized optimization problem with data fidelity and (ℓ1,Lp)-penalty. result High probability bounds on prediction error for the Group-Nonlinear-Lasso solution.
Study vector-valued robust control under uncertainty.
problem Dynamic stochastic control with multi-objective criteria under model uncertainty.
method Robust minimax approach, set-valued framework, dynamic programming principle.
result Derived weak and strong versions of dynamic programming principle for vector-valued control problems.
Study invariant measures on measured laminations for subgroups of mapping class group.
problem Classify invariant Radon measures on space of measured laminations for subgroups of mapping class group.
method Geometric approach, focusing on recurrent measured laminations, explicitly constructing ergodic measures.
result Show uniquely ergodic for divergence-type subgroups, generalize results for full mapping class group.
New set-valued star-shaped risk measures introduced for better risk assessment.
problem Improving risk assessment in financial contexts.
method Developed new set-valued star-shaped risk measures and proved their representation theorems.
result Set-valued star-shaped risk measures can be represented as unions of set-valued convex risk measures.
The Bergman measure converges to the Zhang measure on a hybrid space.
problem Proving convergence of Bergman measures to Zhang measure.
method Analyzing convergence on a hybrid space and metrized curve complex.
result Bergman measure converges to Zhang measure on a hybrid space.
Bayesian approach to robust risk measures under model uncertainty.
problem Representing robust risk measures as a single probability measure.
method Introducing two types of risk measures and analyzing their relation to robust risk measures.
result Robust risk measures can be represented by a mixture probability measure, a Bayesian approach.
The paper studies dynamic star-shaped risk measures and their representation.
problem Representing dynamic star-shaped risk measures and their properties.
method Representation theorems for dynamic monetary and star-shaped risk measures.
result Dynamic star-shaped risk measures can be represented as the lower envelope of a family of dynamic convex risk measures.
Introduces Star-Shaped deviation measures for risk analysis.
problem Risk measurement and analysis in finance.
method Characterizes Star-Shaped deviation measures through acceptance sets and convex deviation measures.
result Exposes the relationship between Star-Shaped risk measures and deviation measures.
Transformers can interpolate between arbitrary measures.
problem Understanding the expressive power of Transformers as measure-to-measure maps.
method Provided an explicit choice of parameters for a single Transformer to match N arbitrary input measures to N arbitrary target measures.
result A single Transformer can interpolate between arbitrary measures.
Classifies invariant measures on specific character varieties.
problem Classifying invariant probability measures on character varieties.
method Measure disintegration along transverse Lagrangian tori fibrations.
result Ergodic measures are either counting measures on finite orbits or Liouville measures.
Paper characterizes star-shaped risk measures and their properties.
problem Characterizing risk measures in the presence of liquidity risk and competitive delegation.
method Characterization of star-shaped risk measures, study of their properties.
result Star-shaped risk measures include all practically used risk measures.
Paper compares fairness measures and feature importance measures using SHAP.
problem Comparing fairness measures and feature importance measures.
method Focus on SHAP, a game-theoretic measure of feature importance.
result Results for unfairness-prone datasets.
Paper introduces quasi-logconvex risk measures and their properties.
problem Characterizing and understanding new risk measures.
method Characterization through dual representation and properties of acceptance sets.
result Established dual representation and taxonomy of quasi-logconvex risk measures.
Submodularity is studied for convex risk measures, including Expected Shortfall.
problem Characterizing submodularity in convex risk measures.
method Analyzing submodularity properties of law-invariant coherent risk measures, including Expected Shortfall and Value-at-Risk.
result AES is submodular only when it reduces to ES, and empirical analysis shows AES violations are less frequent than VaR and ES violations.
New geometric measure simplifies complex analysis.
problem Complex geometric analysis challenges.
method Geometric integration and convergence methods.
result Smallest measure satisfying Area Formula.
The paper explores non-convex risk measures and their characterizations.
problem Characterizing non-convex risk measures without convexity or weak convexity.
method Characterizes monetary risk measures as lower envelopes of families of convex or coherent risk measures, considering law-invariance and SSD-consistency.
result Unified representation theorems for law-invariant risk measures, including VaR.
The paper calculates extreme measures in continuous time conic finance.
problem Determining valuation bounds for financial claims.
method Using dynamic spectral risk measures and estimating extreme measures from market data.
result Explicit formulas for extreme measures' Radon-Nykodim derivatives and estimation methods.
Paper characterizes monotonic mean-deviation risk measures.
problem Developing consistent risk measures from mean-deviation models.
method Applying a risk-weighting function to the deviation part of a mean-deviation model.
result Characterizes monotonic mean-deviation measures as consistent risk measures.
Introduces factor risk measures to assess risk relative to multiple factors.
problem Measuring risk relative to multiple factors.
method Introduces a double-argument mapping as a risk measure to assess risk relative to a vector of factors.
result Characterizes various types of factor risk measures including distortion, quantile, linear, and coherent measures.
Dual representations for robust risk measures and uncertainty sets.
problem Characterizing continuity of robust risk measures and their uncertainty sets.
method Develop dual representations for robust risk measures and uncertainty sets based on distinct geometric assumptions.
result Two dual frameworks for consolidated uncertainty sets are complementary, not interchangeable.
A scalable approach to learning from probability measures using quantization.
problem Efficiently comparing and manipulating large sets of probability measures.
method Quantization of probability measures to a fixed support, followed by optimal transport computations.
result Consistency and convergence guarantees for quantized measures in various OT-based tasks.
Study on measurable pseudo-Anosov maps on surfaces.
problem Characterize dynamics of pseudo-Anosov maps on surfaces.
method Analyze measurable pseudo-Anosov homeomorphisms with specific properties.
result Prove transitivity, dense periodic points, sensitivity, and ergodicity.
In this paper, we propose a new method of Bayesian measurement for spectral deconvolution, which regresses spectral data into the sum of unimodal basis function such as Gaussian or Lorentzian functions. Bayesian measurement is a framework for considering not only the target physical model but also the measurement model…
The Cannon-Thurston map's pushed measures on the circle are singular with respect to sphere measures.
problem Understanding the behavior of geodesics and measures on fibered hyperbolic 3-manifolds.
method Properties of geodesics and measures on the circle and sphere are analyzed to prove singularity.
result Natural measures on the circle become singular with respect to measures on the sphere.
Risk measures for multivariate financial positions are studied in a utility-based framework. Under a certain incomplete preference relation, shortfall and divergence risk measures are defined as the optimal values of specific set minimization problems. The dual relationship between these two classes of multivariate ris…
New weighted surface area measures for convex bodies with applications.
problem Generalizing surface area measures to weighted Borel measures.
method Formulating and analyzing weighted surface area measures, proving integral formula and Bézout-type inequality.
result New integral formula for mixed measure of three bodies, generalizing Bézout-type inequality.
Standardized fairness measures for continuous risk scores using Wasserstein distance.
problem Quantifying and interpreting group disparities in continuous risk scores.
method Proposes standardized fairness measures based on Wasserstein distance for continuous scores.
result Proposed measures outperform ROC-based fairness measures by being more explicit and quantifying significant biases.
Starting with the work of Preiss on the geometry of measures, the classification of uniform measures in Rd has remained open, except for d=1 and for compactly supported measures in d=2, and for codimension 1. In this paper we study 1-dimensional measures in Rd for all d and classify unif…
Study SRB measures for Anosov actions on manifolds.
problem Characterize SRB measures for Anosov actions.
method Use Ruelle-Taylor resonances and properties of Sinai-Ruelle-Bowen measures.
result SRB measures have properties like smooth disintegrations, positive basins, and are unique under certain conditions.