Distorted surfaces in graph manifolds have specific distortion properties.
problem Distortion of surfaces in graph manifolds.
method Analysis of immersed horizontal surfaces in 3D graph manifolds.
result Fundamental group of surfaces is quadratically distorted if virtually embedded, exponentially distorted otherwise.
The paper calculates subgroup distortions in 3-manifold groups.
problem Understanding subgroup distortions in 3-manifold groups.
method Computed all finitely generated subgroups of finitely generated 3-manifold groups and analyzed their distortions.
result Subgroup distortions in 3-manifold groups are linear, quadratic, exponential, or double exponential.
Computes distortion of surfaces in non-geometric 3-manifolds.
problem Distortion of surfaces in non-geometric 3-manifolds.
method Computes distortion of π1(S) in π1(N) and relates it to separability.
result Distortion is linear, quadratic, exponential, or double exponential.
HAMD optimizes cubic portfolios without quadratization, achieving better results.
problem Optimizing higher-order portfolio models with reduced distortion.
method Hybrid pipeline combining continuous Hamiltonian search, cardinality-preserving projection, and iterated local search.
result HAMD achieves significantly lower native cubic objective values than classical heuristics.
The paper debiases mini-batch approximations in deep learning for more accurate optimization and uncertainty quantification.
problem Bias in mini-batch approximations distorts the shape of quadratic approximations used in deep learning.
method Developed and evaluated debiasing strategies for mini-batch approximations.
result Debiasing strategies improve the accuracy of second-order optimization and uncertainty quantification in deep learning.
Improved SGNS model resolves ambiguity in word vector learning.
problem Ambiguity in word vectors under SGNS model.
method Rectified SGNS model with quadratic regularization.
result Simple modification structures the solution effectively.
This paper studies communication efficiency in federated learning by optimizing the sum-rate-distortion function for indirect multiterminal source coding.
problem Indirect multiterminal source coding in federated learning where edge devices send noisy gradients to the server.
method Analyzes the rate region for the quadratic vector Gaussian CEO problem under unbiased estimator and derives an explicit formula for the sum-rate-distortion function.
result Derives an explicit formula for the sum-rate-distortion function in the special case of identical gradients over edge devices.
New method learns disentangled representations using Gromov-Monge maps.
problem Learning disentangled representations from unlabelled data.
method Introduces a novel approach based on Gromov-Monge maps to preserve geometric features while aligning data distributions.
result Demonstrates effectiveness on four benchmarks, outperforming other methods.
Develops a control framework for systemic risk under uncertainty.
problem Systemic risk under model uncertainty.
method Linear-quadratic mean-field control framework with viscosity solutions and verification theorems.
result Explicit feedback controls derived from a coupled Riccati system, preserving analytical tractability.
ResUNet-CMB neural network reconstructs CMB effects from noisy data.
problem Reconstructing CMB anisotropies from noisy data.
method Convolutional neural network (ResUNet-CMB) for simultaneous reconstruction of lensing and reionization.
result ResUNet-CMB outperforms quadratic estimators at low noise levels and avoids lensing-induced bias.
This paper studies the problem of optimal investment with CRRA (constant, relative risk aversion) preferences, subject to dynamic risk constraints on trading strategies. The market model considered is continuous in time and incomplete. the prices of financial assets are modeled by Itô processes. The dynamic risk constr…
A stroke-based method reconstructs characters from noisy images.
problem Challenges in reconstructing characters from noisy images.
method Uses a weighted quadratic Bezier curve (WQBC) to represent strokes.
result Achieves excellent reconstruction in real scenes.
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.
A tubular group is a group that acts on a tree with Z2 vertex stabilizers and Z edge stabilizers. This paper develops further a criterion of Wise and determines when a tubular group acts freely on a finite dimensional CAT(0) cube complex. As a consequence we offer a unified explanation of the fai…
Solves partial assignment problems using random clique complexes.
problem Partial assignment problems, especially with severe occlusions and distortions.
method Formulate as matching random clique complexes, analyze k-skeletons, match adjacency matrices, consider geometric neighbourhoods.
result Outperforms diverse matching algorithms significantly.
Testing independence is of significant interest in many important areas of large-scale inference. Using extreme-value form statistics to test against sparse alternatives and using quadratic form statistics to test against dense alternatives are two important testing procedures for high-dimensional independence. However…
New method corrects complex distortions in single view images.
problem Complex distortions in images, especially those caused by refractive surfaces.
method Differentiable image sampling and semantic information augmentation.
result Model can estimate and correct highly complex distortions.
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.
Finite distortion maps cannot have compact branch sets under growth conditions.
problem Understanding the structure of branch sets in mappings of finite distortion.
method Analyzing the asymptotic growth of distortion and constructing specific examples.
result The bound on the size of branch sets is strict and achievable.
A new family of stochastic dominance orders based on distortion functions.
problem Determining a continuum of dominance relations for risk assessment.
method Introducing H-distorted stochastic dominance, a generalized family of stochastic orders.
result Power-distorted stochastic dominance is particularly appealing due to its simplicity and statistical interpretations.
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.
Sharp bounds on distortion of surfaces in 3D space.
problem Finding the minimum distortion of surfaces in 3D space.
method Analyzing convex embedded 2-spheres and surfaces of positive genus.
result π/2 is a sharp lower bound on the distortion of surfaces of positive genus.
New study shows tradeoffs between compression quality, distortion, and perception.
problem Optimizing compression for low distortion often sacrifices perceptual quality.
method Adopted Blau & Michaeli's perceptual quality definition and studied the rate-distortion-perception tradeoff.
result Restricting perceptual quality to high generally requires a trade-off between rate and distortion.
The distortion of a curve is the supremum, taken over distinct pairs of points of the curve, of the ratio of arclength to spatial distance between the points. Gromov asked in 1981 whether a curve in every knot type can be constructed with distortion less than a universal constant C. Answering Gromov's question seems to…
The study shows exponential distortion in virtually special groups containing free subgroups.
problem Understanding distortion in virtually special groups containing free subgroups.
method Constructing examples of virtually special groups with finite rank free subgroups.
result Distortion functions grow like exp^k(x^m) and can be superexponential.
Estimates rate-distortion function for large datasets using neural networks.
problem Designing lossy data compression schemes and comparing them with theoretical limits.
method Re-formulate rate-distortion objective and solve using neural networks.
result NERD accurately estimates the rate-distortion function for real-world datasets.
Introduces new performance criteria for investment under distorted probabilities.
problem Reconciling time-consistent performance with probability distortions.
method Two definitions of forward rank-dependent criteria, equivalence established; characterization of viable probability distortion processes.
result Characterization of optimal wealth process and new distorted measure.
Introduces a new conditional expectation under distorted probabilities, addressing time-inconsistency.
problem Time-inconsistency in nonlinear expectations under probability distortion.
method Localizes probability distortion and constructs a time-consistent conditional expectation.
result Constructs a conditional expectation that is time-consistent and corresponds to a parabolic differential equation.
Study stabilizers in handlebody group; meridians are undistorted, others are exponentially distorted.
problem Geometric properties of stabilizers in handlebody group.
method Analysis of stabilizers of meridians and primitive curves/annuli.
result Stabilizers of meridians are undistorted, others are exponentially distorted.
New coding theorem shows achievable rate matches theoretical limit.
problem Unknown existence of encoders and decoders for RDPF.
method Used stochastic, variable-length codes to prove RDPF achievable.
result Achievable rate matches theoretical rate-distortion-perception function.
Sharp bounds for distortion risk metrics under uncertain distributions.
problem Modeling risk metrics under distributional uncertainty.
method Established bounds for distortion risk metrics using specific features of underlying distributions.
result Identified worst- and best-case values of distortion risk metrics.
Paper proposes a new black-box attack approach to minimize visual distortion.
problem Constructing adversarial examples that minimize visual distortion in a black-box threat model.
method Learning the noise distribution of adversarial examples to approximate the gradient of a non-differentiable loss function.
result The proposed attack results in much lower visual distortion compared to state-of-the-art black-box attacks.
We construct 2-dimensional CAT(-1) groups which contain free subgroups with arbitrary iterated exponential distortion, and with distortion higher than any iterated exponential.
Study dynamic risk measures and performance indices using distortion functions.
problem Investigate time consistency of dynamic risk measures and performance indices generated by distortion functions.
method Analyze dynamic coherent risk measures (DCRMs) and dynamic weighted value at risk measures, proving their equivalence. Establish properties of families of DCRMs generated by distortion functions and define corresponding dynamic coherent acceptability indices (DCAIs). Examine time consistency of DCRMs and DCAIs.
result DCRM generated by distortion functions are sub-martingale time consistent but not super-martingale time consistent and not weakly acceptance time consistent.
New bounds on knot distortion and Seifert surface properties.
problem Understanding the distortion of knots and properties of Seifert surfaces.
method Analyzing embeddings of Seifert surfaces and using properties of monodromy maps.
result Bounds on the distortion of certain knots and properties of Seifert surfaces.
The paper examines how distortion principles affect insurance pricing under risk aversion and ambiguity.
problem Understanding how risk aversion and ambiguity impact insurance pricing.
method Investigates sensitivity of distortion functionals to risk aversion and ambiguity, using Wasserstein distance.
result Identifies worst-case distributions and methods to identify distortion densities.
The problem behind this paper is the proper measurement of the degree of quality/acceptability/distance to arbitrage of trades. We are narrowing the class of coherent acceptability indices introduced by Cherny and Madan (2007) by imposing an additional mathematical property. For this, we introduce the notion of a conca…
New method tests risk measures for various distortions.
problem Testing risk measures for different distortions.
method Stratification and randomization of risk levels.
result Method performs well in numerical case studies.
Study shows Torelli groups are exponentially distorted in mapping class groups with boundary.
problem Distortion of Torelli groups in mapping class groups with boundary.
method Used Broaddus-Farb-Putman's techniques to prove exponential distortion.
result Torelli groups are at least exponentially distorted in mapping class groups with boundary components.
We study the statistical meaning of the minimization of distortion measure and the relation between the equilibrium points of the SOM algorithm and the minima of distortion measure. If we assume that the observations and the map lie in an compact Euclidean space, we prove the strong consistency of the map which almost …
Paper controls type I error in text classification despite data distortion.
problem Data distortion in open online platforms leads to misclassification.
method Uses Neyman-Pearson (NP) classification paradigm to minimize type I error.
result NP methods control type I error on test data despite data distortion.
Machine learning detects and classifies cognitive distortions in mental health texts.
problem Detect and classify cognitive distortions in mental health texts to improve treatment.
method Machine learning framework using crowdsourced and therapy dataset.
result Model achieved high F1 scores for detecting and classifying cognitive distortions.