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,695 papers · 148 categories

Trend · papers per month

285684112 · Jun 202019922001200920172026
48 results for dual norm

The Euler class conjecture links geometric structures to integral points on the Thurston norm ball.

problem Determining if integral points on the Thurston norm dual ball correspond to geometric structures.
method Examining various geometric, topological, and dynamical structures on 3-manifolds.
result Integral points on the Thurston norm dual ball correspond to the Euler class of taut foliations and other structures.

Estimates the dual Thurston norm for foliations on negative curvature 3-manifolds.

problem Bounding the dual Thurston norm of foliations on 3-manifolds of negative curvature.
method Uses constants like injectivity radius, volume, curvature, and mean curvature of foliation leaves to estimate the dual Thurston norm.
result Provides an upper bound estimate on the dual Thurston norm of the Euler class of a foliation.

Data-driven optimization improves mean-variance portfolios by penalizing norms.

problem Estimation error in mean-variance optimization.
method Augment MVO with norm penalties, use neural networks for optimization, and compute derivatives implicitly.
result Data-driven optimization reduces portfolio risk compared to standard MVO.

We relate the Gromov norm on homology classes to the harmonic norm on the dual cohomology and obtain double sided bounds in terms of the volume and other geometric quantities of the underlying manifold. Along the way, we provide comparisons to other related norms and quantities as well.

2018-09-29abs ↗pdf ↗

Intersection norms are integer norms on the first homology group of a surface. In this article, we prove that there are some polytopes which are not dual unit balls of such norms. By the way, we investigate the set of collections of curves on ΣΣ2 whose complement is a disk.

2018-09-10abs ↗pdf ↗

Dual-sPLS improves feature selection and prediction in high-dimensional data.

problem Relating variables to a response in high-dimensional chemometric problems.
method Generalizes PLS1 algorithm with dual norm penalizations and a shrinking ratio parameter.
result Favorably compares to similar regression methods on simulated and real chemical data.

For every finite collection of curves on a surface, we define an associated (semi-)norm on the first homology group of the surface. The unit ball of the dual norm is the convex hull of its integer points. We give an interpretation of these points in terms of certain coorientations of the original collection of curves. …

2016-04-22abs ↗pdf ↗

One of the popular approaches for low-rank tensor completion is to use the latent trace norm regularization. However, most existing works in this direction learn a sparse combination of tensors. In this work, we fill this gap by proposing a variant of the latent trace norm that helps in learning a non-sparse combinatio…

2017-12-04abs ↗pdf ↗

Derives stability for curvature measure near constant density, proving dual Minkowski problem solutions.

problem Stability of curvature measure near constant density
method Derives stability result for curvature measure, proves existence and uniqueness of solutions to dual Minkowski problem.
result Existence and uniqueness of solutions to dual Minkowski problem for positive indices, stability result for curvature measure.

We show that link Floer homology detects the Thurston norm of a link complement. As an application, we show that the Thurston polytope of an alternating link is dual to the Newton polytope of its multi-variable Alexander polynomial. To illustrate these techniques, we also compute the Thurston polytopes of several speci…

2006-01-25abs ↗pdf ↗

DFR reduces the computational cost of sparse-group lasso and adaptive sparse-group lasso.

problem Sparse-group lasso's computational expense and need for tuning.
method Dual Feature Reduction (DFR) using strong screening rules and dual norms.
result DFR drastically reduces computational cost without affecting solution optimality.

Optimal joint separation condition for radar and communications channels in dual-blind deconvolution.

problem Recovering information from overlaid radar and communications signals with unknown channels.
method Extremal functions from Beurling-Selberg interpolation theory for joint separation, nuclear norm minimization for matrix retrieval, and MUSIC for parameter estimation.
result Guaranteed well-conditioned Vandermonde matrix for MUSIC, validating theoretical findings.

We determine the set of Busemann points of an arbitrary finite-dimensional normed space. These are the points of the horofunction boundary that are the limits of "almost-geodesics". We prove that all points in the horofunction boundary are Busemann points if and only if the set of extreme sets of the dual unit ball is …

2005-10-05abs ↗pdf ↗

Study normal curves in sub-Finsler Lie groups with specific norms, focusing on branching and face stability.

problem Analyzing normal curves in sub-Finsler Lie groups with different norms.
method Using tools from convex analysis, the Pontryagin Maximum Principle is revisited to express the normal equation as a differential inclusion involving the subdifferential of the dual norm.
result Normal curves in polyhedral norms have controls that locally take values in a single face of a sphere with respect to the norm.

We propose a systematic construction of native Banach spaces for general spline-admissible operators L{\rm L}. In short, the native space for L{\rm L} and the (dual) norm X\|\cdot\|_{\mathcal{X}'} is the largest space of functions f:RdRf: \mathbb{R}^d \to \mathbb{R} such that LfX<\|{\rm L} f\|_{\mathcal{X}'}<\infty, subj…

2019-04-24abs ↗pdf ↗

In this paper we use Heegaard Floer link homology to determine the dual Thurston polytope for pretzel links of the form P(-2r_1-1, 2q_1, -2q_2, 2r_2+1) where r_i and q_i are positive integers. We apply this result to determine the Thurston norms of spanning surfaces for the individual link components, and we explicitly…

2006-09-16abs ↗pdf ↗

Entropic regularization is quickly emerging as a new standard in optimal transport (OT). It enables to cast the OT computation as a differentiable and unconstrained convex optimization problem, which can be efficiently solved using the Sinkhorn algorithm. However, entropy keeps the transportation plan strictly positive…

2017-10-17abs ↗pdf ↗

We show that the spectral norm of a random n1×n2××nKn_1\times n_2\times \cdots \times n_K tensor (or higher-order array) scales as O((k=1Knk)log(K))O\left(\sqrt{(\sum_{k=1}^{K}n_k)\log(K)}\right) under some sub-Gaussian assumption on the entries. The proof is based on a covering number argument. Since the spectral norm is dual to the tensor…

2014-07-07abs ↗pdf ↗

For a 3-manifold M, McMullen derived from the Alexander polynomial of M a norm on H^1(M, R) called the Alexander norm. He showed that the Thurston norm on H^1(M, R), which measures the complexity of a dual surface, is an upper bound for the Alexander norm. He asked if these two norms were equal on all of H^1(M,R) when …

1999-08-11abs ↗pdf ↗

This paper certifies cluster assignments from sum-of-norms clustering algorithms.

problem Certifying the correct cluster assignments from approximate solutions of sum-of-norms clustering.
method Presented a clustering test that identifies and certifies the correct cluster assignment from an approximate solution.
result The correct cluster assignment is guaranteed to be certified by a primal-dual path following algorithm after sufficient iterations.

Unified analysis of parameter norms in overparameterized linear models, revealing scaling laws and thresholds.

problem Understanding the scaling of parameter norms in overparameterized linear models.
method Simple dual-ray analysis revealing competition between signal spike and bulk of null coordinates.
result Unified closed-form predictions for parameter norm scaling, including elbow and threshold laws.

Every element in the first cohomology group of a 3--manifold is dual to embedded surfaces. The Thurston norm measures the minimal `complexity' of such surfaces. For instance the Thurston norm of a knot complement determines the genus of the knot in the 3--sphere. We show that the degrees of twisted Alexander polynomial…

2005-05-26abs ↗pdf ↗

A new method for compressive classification using bridge regression.

problem Efficient pattern classification with compact representation.
method Proposed a deterministic bridge regression solution for compressive classification.
result Validation of the proposed solution through numerical studies on simulated and real-world data.

Consider a convex polygon P in the plane, and denote by U a homothetical copy of the vector sum of P and (-P). Then the polygon U, as unit ball, induces a norm such that, with respect to this norm, P has constant Minkowskian width. We define notions like Minkowskian curvature, evolutes and involutes for polygons of con…

2014-06-12abs ↗pdf ↗

Study on scalar curvature bounds and manifold topological complexity.

problem Understanding the topological complexity of manifolds with scalar curvature constraints.
method Introduced a small scale index theorem to establish bounds for Gromov's simplicial norm.
result Upper bound for Gromov's simplicial norm established in terms of scalar curvature, volume, and injectivity radius.

In this paper we answer positively a question raised by Kapovich and Leeb in a paper titled "Finsler bordifications of symmetric and certain locally symmetric spaces". Specifically, we show that for a finite-dimensional vector space with a polyhedral norm, its horofunction compactification is homeomorphic to the dual u…

2016-07-02abs ↗pdf ↗

We construct a canonical element, called the refined analytic torsion, of the determinant line of the cohomology of a closed oriented odd-dimensional manifold M with coefficients in a flat complex vector bundle E. We compute the Ray-Singer norm of the refined analytic torsion. In particular, if there exists a flat Herm…

2005-10-25abs ↗pdf ↗

In the dual LΦL_{Φ^*} of a Δ2Δ_2-Orlicz space LΦL_Φ, that we call a dual Orlicz space, we show that a proper (resp. finite) convex function is lower semicontinuous (resp. continuous) for the Mackey topology τ(LΦ,LΦ)τ(L_{Φ^*},L_Φ) if and only if on each order interval [ζ,ζ]={ξ:ζξζ}[-ζ,ζ]=\{ξ: -ζ\leq ξ\leqζ\} (ζLΦζ\in L_{Φ^*}), it is lowe…

2016-11-18abs ↗pdf ↗

The paper extends Johnson's characterization of amenable groups to homomorphisms and acyclicity in bounded cohomology.

problem Characterizing amenable and acyclic groups and homomorphisms in bounded cohomology.
method Extending Johnson's characterization to homomorphisms and proving analogous results for boundedly acyclic homomorphisms.
result Characterizations of amenable and boundedly acyclic homomorphisms in terms of bounded cohomology vanishing.

We study the limits of holonomy representations of complex projective structures on a compact Riemann surface in the Morgan-Shalen compactification of the character variety. We show that the dual R-trees of the quadratic differentials associated to a divergent sequence of projective structures determine the Morgan-Shal…

2011-05-25abs ↗pdf ↗

DCCNNs reduce computational overhead and ambiguity in convolutional neural networks.

problem Reducing computational overhead and ambiguity in convolutional neural networks.
method Introducing a primal learning problem and constructing a dual convex training program, using Fenchel conjugates and Karush-Kuhn-Tucker conditions.
result Eliminates ambiguity and reduces computational overhead in constructing a large kernel matrix.