Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

4897145193 · Jun 202019922001200920172026
48 results for small distortion

Quasiregular curves in product manifolds are shown to be carried by quasiregular maps.

problem Characterizing quasiregular curves in product manifolds with small distortion.
method Analyzing KK-quasiregular volNimes\operatorname{vol}_N^ imes-curves in product manifolds N=N1imesimesNkN=N_1 imes \cdots imes N_k.
result Quasiregular curves of small distortion in product manifolds are carried by quasiregular maps.

The study finds minimal distortion embeddings of surfaces into small domains.

problem Finding the minimal distortion of embeddings between two-dimensional manifolds.
method Proving a lower bound on distortion in terms of areas' discrepancy, characterizing minimizers, and proving stability.
result Homotheties are the unique minimizers for VN/VM1/4V_{\mathcal{N}}/V_{\mathcal{M}} \ge 1/4, and non-homothetic minimizers exist for VN/VM1/4V_{\mathcal{N}}/V_{\mathcal{M}} \le 1/4.

Investigates stability of Epstein-Zin problem under market distortions.

problem Stability of Epstein-Zin problem in incomplete markets.
method Analyzes perturbations in returns and volatility, and interest rate; proves convergence of optimal solutions.
result Proves convergence of optimal consumption streams and value functions in the limit of model perturbations.

New bounds on generalization error for distributed learning using rate-distortion theory.

problem Establishing upper bounds on generalization error for distributed learning algorithms.
method Using rate-distortion theory, the paper introduces new bounds that depend on the compressibility of each client's algorithm.
result The bounds suggest that the generalization error of the distributed setting decays faster than that of the centralized one with a factor of O(log(K)/K)\mathcal{O}(\log(K)/\sqrt{K}).

Recent studies have highlighted the vulnerability of deep neural networks (DNNs) to adversarial examples - a visually indistinguishable adversarial image can easily be crafted to cause a well-trained model to misclassify. Existing methods for crafting adversarial examples are based on L2L_2 and LL_\infty distortion me…

2017-09-13abs ↗pdf ↗

Recent work has shown that additive threat models, which only permit the addition of bounded noise to the pixels of an image, are insufficient for fully capturing the space of imperceivable adversarial examples. For example, small rotations and spatial transformations can fool classifiers, remain imperceivable to human…

2019-02-21abs ↗pdf ↗

We demonstrate that the lowest possible price change (tick-size) has a large impact on the structure of financial return distributions. It induces a microstructure as well as it can alter the tail behavior. On small return intervals, the tick-size can distort the calculation of correlations. This especially occurs on s…

2010-01-28abs ↗pdf ↗

Verifying the robustness property of a general Rectified Linear Unit (ReLU) network is an NP-complete problem [Katz, Barrett, Dill, Julian and Kochenderfer CAV17]. Although finding the exact minimum adversarial distortion is hard, giving a certified lower bound of the minimum distortion is possible. Current available m…

2018-04-25abs ↗pdf ↗

We consider the problem of distortion minimal morphing of nn-dimensional compact connected oriented smooth manifolds without boundary embedded in Rn+1\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…

2006-05-25abs ↗pdf ↗

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.

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 …

2019-11-15abs ↗pdf ↗

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…

2004-09-22abs ↗pdf ↗

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.

The adaptive optimizer for training neural networks has continually evolved to overcome the limitations of the previously proposed adaptive methods. Recent studies have found the rare counterexamples that Adam cannot converge to the optimal point. Those counterexamples reveal the distortion of Adam due to a small secon…

2019-11-01abs ↗pdf ↗

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…

2017-09-25abs ↗pdf ↗

We formalise the widespread idea of interpreting neural network decisions as an explicit optimisation problem in a rate-distortion framework. A set of input features is deemed relevant for a classification decision if the expected classifier score remains nearly constant when randomising the remaining features. We disc…

2019-05-27abs ↗pdf ↗

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.

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.

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.

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.

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 …

2019-04-28abs ↗pdf ↗

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…

2011-04-04abs ↗pdf ↗

New insights into image compression trade-offs with private randomness.

problem Trade-off between compression rate and perceptual quality in image compression.
method Characterization of rate-distortion trade-off with private randomness under different realism constraints.
result Encoder private randomness is not useful if compression rate is below source entropy, even with limited common and decoder private randomness.

Lossy compression algorithms are typically designed and analyzed through the lens of Shannon's rate-distortion theory, where the goal is to achieve the lowest possible distortion (e.g., low MSE or high SSIM) at any given bit rate. However, in recent years, it has become increasingly accepted that "low distortion" is no…

2019-01-23abs ↗pdf ↗

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 …

2008-02-21abs ↗pdf ↗

We study the Teichmüller metric on the Teichmüller space of a surface of finite type, in regions where the injectivity radius of the surface is small. The main result is that in such regions the Teichmüller metric is approximated up to bounded additive distortion by the sup metric on a product of lower dimensional spac…

1994-07-05abs ↗pdf ↗

It is known that the surface of a cone over the unit disc with large height has smaller distortion than the standard embedding of the 2-sphere in R3\mathbb R^3. In this note we show that distortion minimisers exist among convex embedded 2-spheres and have uniformly bounded eccentricity. Moreover, we prove that π/2π/2 is…

2019-04-16abs ↗pdf ↗