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

Trend · papers per month

13263851 · Feb 202019922001200920172026
48 results for Fractional quasi p-norms

Paper addresses concentration of distances for fractional quasi p-norms, identifying conditions for concentration and anti-concentration.

problem Understanding concentration of distances for fractional quasi p-norms in high dimensions.
method Analyzes conditions for concentration and anti-concentration of distances for fractional quasi p-norms.
result Identifies conditions for concentration and anti-concentration of fractional quasi p-norms, ruling out some approaches and specifying conditions for control.

Study examines surfaces with bounded fractional mean curvature, proving control over local parametrization.

problem Understanding surfaces with bounded fractional mean curvature.
method Investigates bounded L^p-norm of fractional mean curvature, proving control over local parametrization.
result Proves control over local parametrization, leading to lower Ahlfors-regularity, weak Michael-Simon type inequality, and stability application.

In this paper, we propose p\ell_p-norm regularized models to seek near-optimal sparse portfolios. These sparse solutions reduce the complexity of portfolio implementation and management. Theoretical results are established to guarantee the sparsity of the second-order KKT points of the p\ell_p-norm regularized models…

2013-12-22abs ↗pdf ↗

This paper studies Brownian motion and heat kernel measure on a class of infinite dimensional Lie groups. We prove a Cameron-Martin type quasi-invariance theorem for the heat kernel measure and give estimates on the LpL^p norms of the Radon-Nikodym derivatives. We also prove that a logarithmic Sobolev inequality holds …

2009-02-14abs ↗pdf ↗

Study improves image classifier robustness to random p-norm corruptions.

problem Improving robustness of image classifiers to real-world imperceptible corruptions.
method Training and testing with random p-norm corruptions, evaluating robustness against different p-norms.
result Training with a combination of p-norm corruptions significantly improves robustness.

The paper proposes an efficient algorithm for solving Schatten-pp quasi-norm problems.

problem Finding low-rank solutions of linear inverse problems with Schatten-pp quasi-norm regularization.
method Dynamic proximal gradient algorithm using Cayley transformation and adaptive step size selection.
result The algorithm converges to a stationary point of the objective function under mild assumptions.

Researchers develop neural networks for approximating functions in Banach spaces.

problem Approximating Banach space valued continuous functions.
method Quasi-interpolation Banach space valued neural network operators using algebraic sigmoid functions.
result Jackson type inequalities for function approximation.

In this paper, we study global existence and blow up properties to LpL^p norm preserving non-local heat flows. We first study two kinds of LpL^p norm preserving non-local flows and prove that these flows have the global solutions. Finally, we give a example to show that one kind of this heat flow may blow up in $L^{\in…

2009-10-26abs ↗pdf ↗

The Schatten quasi-norm can be used to bridge the gap between the nuclear norm and rank function, and is the tighter approximation to matrix rank. However, most existing Schatten quasi-norm minimization (SQNM) algorithms, as well as for nuclear norm minimization, are too slow or even impractical for large-scale problem…

2016-06-02abs ↗pdf ↗

This paper tackles robustness of ensemble stumps and trees under general ℓ_p norm perturbations.

problem The vulnerability of ensemble stumps and trees to small input perturbations under the ℓ_∞ norm.
method Developed dynamic programming algorithms for robustness verification and certified defense under general ℓ_p norm perturbations.
result First certified defense method for ensemble stumps and trees under ℓ_p norm perturbations.

Proposes a new regression method using LpL_p-norms for non-Gaussian noise.

problem Non-Gaussian noise in residuals affects the performance of local least squares regression.
method Introduces local polynomial LpL_p-norm regression, replacing weighted least squares with weighted LpL_p-norm estimation.
result Demonstrates superior performance over local least squares in one-dimensional data and higher dimensions.

We introduce W-spin structures on a Riemann surface and give a precise definition to the corresponding W-spin equations for any quasi-homogeneous polynomial W. Then, we construct examples of nonzero solutions of spin equations in the presence of Ramond marked points. The main result of the paper is a compactness theore…

2004-09-22abs ↗pdf ↗

Image classifiers are sensitive to small changes, affecting most images in a class.

problem Sensitivity of image classifiers to small perturbations.
method Demonstrated sensitivity for any classifier over images, showing that for most classes, a tiny perturbation can change the classification of a majority of images.
result Image classifiers are sensitive to small perturbations, affecting most images in a class.

Rough volatility models are continuous time stochastic volatility models where the volatility process is driven by a fractional Brownian motion with the Hurst parameter smaller than half, and have attracted much attention since a seminal paper titled "Volatility is rough" was posted on SSRN in 2014 showing that the log…

2019-05-13abs ↗pdf ↗

Adversarial attacks aim to confound machine learning systems, while remaining virtually imperceptible to humans. Attacks on image classification systems are typically gauged in terms of pp-norm distortions in the pixel feature space. We perform a behavioral study, demonstrating that the pixel pp-norm for any $0\le p …

2019-06-06abs ↗pdf ↗

The paper analyzes the performance of empirical risk minimization for pp-norm linear regression.

problem Empirical risk minimization on pp-norm linear regression.
method Analyzes performance under various conditions and moment assumptions.
result High probability excess risk bounds for empirical risk minimizer, matching asymptotic rates.

The paper proposes a novel MKL approach for OCC using p\ell_p-norm constraints.

problem Addressing the MKL problem for one-class classification.
method A min-max saddle point Lagrangian optimisation problem is formulated and solved efficiently.
result The proposed method outperforms baselines and other algorithms on various data sets.

Consider a smooth, projective family of canonically polarized varieties over a smooth, quasi-projective base manifold Y, all defined over the complex numbers. It has been conjectured that the family is necessarily isotrivial if Y is special in the sense of Campana. We prove the conjecture when Y is a surface or threefo…

2009-05-12abs ↗pdf ↗

The paper proposes a new method for dictionary learning using p\ell_p-norm maximization.

problem Complete dictionary learning problem in signal processing and data analytics.
method The paper investigates p\ell_p-norm maximization approaches for complete dictionary learning, proving global maximizers are close to the true dictionary and developing an efficient algorithm based on the generalized power method.
result The p\ell_p-based approaches are more efficient and robust than conventional methods, with p=3p=3 performing best.

Semantify-NN verifies neural network robustness against semantic perturbations.

problem Verifying robustness of neural networks against semantic adversarial attacks.
method Inserting semantic perturbation layers (SP-layers) into neural networks to verify robustness.
result Semantify-NN significantly improves robustness verification performance over p\ell_p-norm-based methods.

We give improved algorithms for the p\ell_{p}-regression problem, minxxp\min_{x} \|x\|_{p} such that Ax=b,A x=b, for all p(1,2)(2,).p \in (1,2) \cup (2,\infty). Our algorithms obtain a high accuracy solution in O~p(mp22p+p2)O~p(m13)\tilde{O}_{p}(m^{\frac{|p-2|}{2p + |p-2|}}) \le \tilde{O}_{p}(m^{\frac{1}{3}}) iterations, where each iteration requires s…

2019-01-21abs ↗pdf ↗

The issue addressed in this paper is that of testing for common breaks across or within equations of a multivariate system. Our framework is very general and allows integrated regressors and trends as well as stationary regressors. The null hypothesis is that breaks in different parameters occur at common locations and…

2016-06-01abs ↗pdf ↗

General lower bounds on neural network approximation in L^p norm.

problem Fundamental limits of neural network expressivity.
method General lower bound proof on approximation in L^p norm, applied to feed-forward neural networks.
result Neural networks can't approximate certain functions as well as previously thought.

The Schatten-pp norm (0<p<10<p<1) has been widely used to replace the nuclear norm for better approximating the rank function. However, existing methods are either 1) not scalable for large scale problems due to relying on singular value decomposition (SVD) in every iteration, or 2) specific to some pp values, e.g., $1/…

2016-11-25abs ↗pdf ↗

Improved estimation of concentration using half-spaces for adversarial vulnerability.

problem Understanding the concentration of measure phenomenon and its impact on adversarial vulnerability.
method Extending Gaussian Isoperimetric Inequality to non-spherical Gaussian measures and arbitrary ℓ_p-norms, using half-spaces to estimate concentration.
result Proposed method finds tighter intrinsic robustness bounds, providing evidence against concentration as a cause of adversarial vulnerability.

In this article we study the induced geodesic distance of fractional order Sobolev metrics on the groups of (volume preserving) diffeomorphisms and symplectomorphisms. The interest in these geometries is fueled by the observation that they allow for a geometric interpretation for prominent partial differential equation…

2018-05-11abs ↗pdf ↗

We investigate stability and local minimizing properties of the Riemannian functional defined by the L^p norm of the curvature tensor on the space of Riemannian metrics on a closed manifold. Riemannian metrics with constant curvature and products of such metrics are critical points of this functional. We prove that the…

2012-01-09abs ↗pdf ↗

The authors define a class of functions on Riemannian manifolds, which is called geodesic semilocal E-preinvex functions, as a generalization of geodesic semilocal E-convex and geodesic semi E-preinvex functions and some of its properties are established. Furthermore, a nonlinear fractional multiobjective programming i…

2018-08-28abs ↗pdf ↗

Simple regional perturbations maintain model transferability while reducing adversarial example distortion.

problem Comparing efficacy of regional adversarial attacks without complex methods.
method Developed a simple regional adversarial perturbation attack using cross-entropy sign.
result Localized adversarial examples require significantly less LpL_p norm distortion compared to non-local counterparts.

This paper proposes a set of new error criteria and learning approaches, Adaptive Normalized Risk-Averting Training (ANRAT), to attack the non-convex optimization problem in training deep neural networks (DNNs). Theoretically, we demonstrate its effectiveness on global and local convexity lower-bounded by the standard …

2015-06-08abs ↗pdf ↗

ScoreAG generates unrestricted adversarial images maintaining semantic integrity.

problem Limited robustness evaluations due to p\ell_p-norm constraints.
method Score-Based Adversarial Generation (ScoreAG) using score-based generative models.
result ScoreAG improves robustness assessments across multiple benchmarks.

We extend a result of the second author \cite[Theorem 1.1]{soggekaknik} to dimensions d3d \geq 3 which relates the size of LpL^p-norms of eigenfunctions for 2<p<2(d+1)d12<p<\frac{2(d+1)}{d-1} to the amount of L2L^2-mass in shrinking tubes about unit-length geodesics. The proof uses bilinear oscillatory integral estimates of Lee …

2013-01-30abs ↗pdf ↗

Active sampling algorithm for linear regression with various norms and improved query complexity.

problem Efficiently querying a few entries of a target vector for near optimal minimizers of linear regression.
method Lewis weight sampling and active sampling algorithms for different pp norms.
result Optimal query complexity for p(0,1)p \in (0,1), 1<p<21<p<2, and 2<p<2<p<\infty.

Noise2Filter improves 3D tomography reconstruction efficiency and accuracy.

problem Efficiently reconstructing 3D tomographic images in real-time with limited data.
method Self-supervised learning and a learned filter method.
result Noise2Filter achieves real-time reconstruction with limited loss of accuracy.

New nonconvex regularizers improve low-rank matrix recovery efficiency and accuracy.

problem Efficiently recover low-rank matrices from incomplete data.
method Factor group-sparse regularization, related to Schatten-p norms.
result Improved generalization error bounds for Schatten-p norms as p decreases.

Inspired by the LG/CY correspondence, we study the local index theory of the Schrödinger operator associated to a singularity defined on Cn{\mathbb C}^n by a quasi-homogeneous polynomial ff. Under some mild assumption on ff, we show that the small time heat kernel expansion of the corresponding Schrödinger operator e…

2016-03-21abs ↗pdf ↗

We apply the integral formula of volumes to the family of graded linear series constructed from any test configuration. This solves the conjecture raised by Witt--Nyström so that the sequence of spectral measures for the induced C\mathbb{C}^*-action on the central fiber converges to the canonical Duistermatt--Heckman …

2012-11-10abs ↗pdf ↗