arXiv research

New method corrects complex distortions in single view images.

ReLU networks don't exponentially distort curve lengths as previously thought.

New method improves bivariate causal discovery by accurately estimating cause variable complexity.

Paper proposes efficient method for estimating risk measures in complex models.

Optimizes riskmetrics with uncertainty, making complex problems simpler.

We propose computationally efficient encoders and decoders for lossy compression using a Sparse Regression Code. The codebook is defined by a design matrix and codewords are structured linear combinations of columns of this matrix. The proposed encoding algorithm sequentially chooses columns of the design matrix to suc…

Proposes a neural network method to correct residual distortions in coordinate transformations.

We consider several ways to measure the `geometric complexity' of an embedding from a simplicial complex into Euclidean space. One of these is a version of `thickness', based on a paper of Kolmogorov and Barzdin. We prove inequalities relating the thickness and the number of simplices in the simplicial complex, general…

Given a finite metric CW complex $X$ and an element $α\in π_n(X)$, what are the properties of a geometrically optimal representative of $α$? We study the optimal volume of $kα$ as a function of $k$. Asymptotically, this function, whose inverse, for reasons of tradition, we call the volume distortion, turns out to be an…

Vertex distortion detects if a knot is unknot.

IsUMap improves data visualization of complex geometries.

Framework uses IRL and RL to elicit and optimize risk preferences robustly to noise.

New method estimates rate-distortion function using optimal transport.

Algorithm finds optimal affine transformation to minimize overall distortion.

Vertex distortion measures how far lattice knots deviate from straight lines.

We consider the problem of distortion minimal morphing of $n$-dimensional compact connected oriented smooth manifolds without boundary embedded in $\R^{n+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.

The paper connects geometric and topological concepts to bound distances between metric spaces.

Unified bounds linking compressibility, fractal dimensions, and mutual information.

Study distortion risk measures for step-weighted distributions.

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…

Given a simplicial complex $K$, we consider several notions of geometric complexity of embeddings of $K$ in a Euclidean space ${\mathbb R}^d$: thickness, distortion, and refinement complexity (the minimal number of simplices needed for a PL embedding). We show that any $n$-complex with $N$ simplices which topologically…

Computed distortion coefficients for the α-Grushin plane.

Study on risk measures using distorted Choquet integrals with random distortions.

We present an information-theoretic framework for bounding the number of labeled samples needed to train a classifier in a parametric Bayesian setting. We derive bounds on the average $L_p$ distance between the learned classifier and the true maximum a posteriori classifier, which are well-established surrogates for th…

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 …

Study shows how high-budget agents can manipulate prediction markets.

New framework uses cohomology to analyze probabilistic distortions and arbitrage.

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…

New method reduces neural image compression run-time by 50%.

Survey on reproducibility and distortion issues in text clustering and topic modeling.

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.

A framework compares image representations based on local geometry.

Estimates rate-distortion function for large datasets using neural networks.

A robust method for decomposing spectral peaks robust to distortion and interference.

Model compression has been introduced to reduce the required hardware resources while maintaining the model accuracy. Lots of techniques for model compression, such as pruning, quantization, and low-rank approximation, have been suggested along with different inference implementation characteristics. Adopting model com…

New coding theorem shows achievable rate matches theoretical limit.

We construct 2-dimensional CAT(-1) groups which contain free subgroups with arbitrary iterated exponential distortion, and with distortion higher than any iterated exponential.

Paper proposes a new black-box attack approach to minimize visual distortion.

Sharp bounds for distortion risk metrics under uncertain distributions.

Study dynamic risk measures and performance indices using distortion functions.

New bounds on knot distortion and Seifert surface properties.

In this paper, we compute the subgroup distortion of all finitely generated subgroups of all finitely generated 3-manifold groups, and the subgroup distortion in this case can only be linear, quadratic, exponential and double exponential. It turns out that the subgroup distortion of a subgroup of a 3-manifold group is …

This work extends alpha-beta divergences to complex data and finds closed-form solutions.

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…

Motivated by models of human decision making proposed to explain commonly observed deviations from conventional expected value preferences, we formulate two stochastic multi-armed bandit problems with distorted probabilities on the reward distributions: the classic $K$-armed bandit and the linearly parameterized bandit…

New method tests risk measures for various distortions.