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

111222332443 · Jun 202019922001200920172026
48 results for minimality assumption

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.

In this paper we study the area minimizing problem in some kinds of conformal cones. This concept is a generalization of the cones in Eulcidean spaces and the cylinders in product manifolds. We define a non-closed-minimal (NCM) condition for bounded domains. Under this assumption and other necessary conditions we estab…

2020-01-17abs ↗pdf ↗

It is shown that mm disjoint sets with fixed Gaussian volumes that partition Rn\mathbb{R}^{n} with minimum Gaussian surface area must be (m1)(m-1)-dimensional. This follows from a second variation argument using infinitesimal translations. The special case m=3m=3 proves the Double Bubble problem for the Gaussian measure,…

2018-05-25abs ↗pdf ↗

GALA framework learns invariant graph representations via environment augmentation with minimal assumptions.

problem Learning invariant graph representations from different environments without additional assumptions.
method Developed GALA framework with minimal assumptions of variation sufficiency and consistency. Uses an assistant model to differentiate graph environment changes.
result Extracting maximally invariant subgraphs to proxy predictions identifies underlying invariant subgraphs for successful out-of-distribution generalization.

Paper finds conditions for minimal hypersurfaces in S^6 with constant scalar curvature.

problem Finding conditions for minimal hypersurfaces in S^6 with constant scalar curvature.
method Assumptions on principal curvatures for isoparametric hypersurfaces.
result Rigidity result: Hypersurfaces with exactly two distinct principal curvatures are Clifford tori.

In this paper, under the assumption of Gauss curvature vanishing at infinity, we will prove Meeks' conjecture: the number of disjointly supported minimal graphs in R3\mathbb{R}^3 is at most two.

2011-08-26abs ↗pdf ↗

Study minimal volume entropy for free-by-cyclic groups and 2D right-angled Artin groups.

problem Characterize minimal volume entropy for aspherical simplicial complexes with these groups as fundamental groups.
method Algebraic and geometric characterization, using fiber π1π_1-growth collapse and non-collapsing assumptions.
result Provide bounds and criteria for minimal volume entropy in aspherical simplicial complexes.

Paper achieves ε2ε^{-2} sample complexity for actor-critic methods with minimal assumptions.

problem Achieving ε2ε^{-2} sample complexity for actor-critic methods under minimal assumptions.
method Single-loop, single-timescale implementation; coupled Lyapunov drift framework.
result First ildeO(ε2) ilde{\mathcal{O}}(ε^{-2}) sample complexity guarantee for finding an εε-optimal policy.

We study the asymptotic Dirichlet problem for ff-minimal graphs in Cartan-Hadamard manifolds MM. ff-minimal hypersurfaces are natural generalizations of self-shrinkers which play a crucial role in the study of mean curvature flow. In the first part of this paper, we prove the existence of ff-minimal graphs with pre…

2016-05-06abs ↗pdf ↗

Study reward-free RL in non-linear settings, improving efficiency and removing assumptions.

problem Improving sample efficiency in reward-free reinforcement learning for non-linear function approximation.
method Proposed RFOLIVE algorithm for minimal structural assumptions, analyzed hardness results for reward-free and reward-aware exploration.
result Statistical efficiency and hardness results under various structural assumptions, no need for reachability or explorability assumptions.

The paper analyzes risk bounds and Rademacher complexity in batch RL.

problem Estimating/minimizing Bellman error with general value function approximation.
method Characterizes generalization performance using Rademacher complexities of function classes.
result Risk bounds and Rademacher complexities provide insights into batch RL.

We study the pricing and hedging of derivatives in incomplete financial markets by considering the local risk-minimization method in the context of the benchmark approach, which will be called benchmarked local risk-minimization. We show that the proposed benchmarked local risk-minimization allows to handle under extre…

2012-10-08abs ↗pdf ↗

The paper proves an infinite double bubble theorem in higher dimensions.

problem Characterizing minimizing partitions of infinite and finite volumes in Rn\mathbb{R}^n.
method Proves a variant of the double bubble theorem for configurations with infinite and finite chambers.
result Locally minimizing (1,2)(1,2)-clusters are unique in Rn\mathbb{R}^n for n7n\leq 7 and n8n\geq 8 under certain conditions.

Paper shows faster convergence to local-minimizers in over-parametrized models under interpolation-like conditions.

problem Escaping saddle-points in over-parametrized models.
method Stochastic and deterministic optimization algorithms under interpolation-like conditions.
result Oracle complexity of PSGD and SCRN algorithms to reach εε-local-minimizer matches or improves upon deterministic rates.

Paper shows robust generative learning with minimal assumptions on target distributions.

problem Learning generative models with minimal assumptions on target distributions.
method Lipschitz-regularized αα-divergences with minimal assumptions.
result Stable learning across various target distributions with minimal assumptions.

Let N be a complete, homogeneously regular Riemannian manifold of dimension greater than 2 and let M be a compact submanifold of N. Let ΣΣ be a compact orientable surface with boundary. We show that for any continuous f:(Σ,Σ)(N,M)f: (Σ, \partial Σ) \rightarrow (N, M) for which the induced homomorphism on certain fundamental gro…

2012-09-06abs ↗pdf ↗

New algorithm reduces regret in combinatorial causal bandits without graph structure.

problem Minimizing regret in combinatorial causal bandits without graph structure.
method Design of algorithms for binary general causal models and BGLMs without graph skeleton.
result Achieves O(TlnT)O(\sqrt{T}\ln T) expected regret for causal models and O(T23lnT)O(T^{\frac{2}{3}}\ln T) for BGLMs.

New method uses minimal assumptions for machine learning, improving performance and speed.

problem Current machine learning methods require specific model assumptions that are not derived from prior knowledge.
method Assumes scale invariance principles and differentiability of the true function to derive a novel stochastic process.
result The method achieves equal performance to Gaussian process regression but is less arbitrary, faster, and has better extrapolation.

We show that strictly stable components of Allen-Cahn minimal hypersurfaces always occur with multiplicity one. We also establish the uniqueness of solutions converging to nondegenerate hypersurfaces with multiplicity one. Our results work in all dimensions and without variational assumptions on the Allen-Cahn solution…

2019-12-19abs ↗pdf ↗

We consider two natural classes of minimal laminations in three-manifolds. Both classes may be thought of as limits - in different senses - of embedded minimal disks. In both cases, we prove that, under a natural geometric assumption on the three-manifold, the leaves of these laminations are topologically either disks,…

2013-09-24abs ↗pdf ↗

Let (M,g)(M, g) be an nn-dimensional complete Riemannian manifold with Ric(M)(n1)QRic(M)\geq-(n-1)Q, where Q0Q\geq0 is a constant. We obtain an interior gradient bound for minimal graphs in M×RM\times R under some technical assumptions. For details, see Theorem 2.

2004-07-28abs ↗pdf ↗

New theorem on 3-manifolds with curvature and convex boundary.

problem Understanding 3-manifolds with specific curvature and boundary properties.
method Analyzes properties of Riemannian 3-manifolds with nonnegative scalar curvature and mean-convex boundary.
result Shows flatness of certain 3-manifolds containing specific geometric objects.

New method speeds up diffusion models without requiring complex assumptions.

problem Slow sampling in diffusion models due to high computational cost.
method Training-free acceleration scheme under minimal assumptions.
result Provable acceleration within O~(d5/4/ε)\widetilde{O}(d^{5/4}/\sqrt{\varepsilon}) iterations.

We show that in the setting of proper metric spaces one obtains a solution of the classical two-dimensional Plateau problem by minimizing the energy, as in the classical case, once a definition of area (in the sense of convex geometry) has been chosen appropriately. We prove the quasi-convexity of this new definition o…

2015-07-09abs ↗pdf ↗

In this paper, we prove the nonexistence of L2L^2 harmonic 1-forms on a complete super stable minimal submanifold MM in hyperbolic space under the assumption that the first eigenvalue λ1(M)λ_1 (M) for the Laplace operator on MM is bounded below by (2n1)(n1)(2n-1)(n-1). Moreover, we provide sufficient conditions for minimal sub…

2010-07-05abs ↗pdf ↗

Unified framework for best arm identification and dueling bandits regret minimization.

problem Best arm identification and dueling bandits regret minimization.
method Tree-Guided Identify-Then-Exploit (TG-ITE) framework.
result Unified approach achieving optimal sample complexity and regret guarantees.

The paper studies stability and minimizing properties of higher codimensional surfaces in Euclidean space.

problem Stability and minimizing properties of higher codimensional surfaces in Euclidean space.
method Analyzes surfaces associated with the weighted area-functional and proves stability and minimization properties under specific conditions.
result Minimal cones with globally flat normal bundles are ff-stable, and highly singular determinantal varieties and Pfaffian varieties are ff-minimizing.

Improved analysis for diffusion models reduces KL divergence error dependence on data dimension and discretization step size.

problem Analyze the convergence of diffusion-based generative models under minimal assumptions.
method Model the generation process as a composition of reverse ODE and noising steps, leveraging Wasserstein-type error control and noise addition.
result Achieved a linear dependence on data dimension and improved dependence on discretization step size for KL divergence error.