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

6481,2971,9452,593 · Jun 202019922001200920172026
48 results for zeros of even order

The study finds smooth structures on specific 4-manifolds with even fundamental groups.

problem Investigating smooth structures on 4-manifolds with even fundamental groups.
method Analyzing topological, closed, oriented, non-spin 4-manifolds with given constraints.
result Existence of either none or infinitely many distinct smooth structures on specified manifolds.

New algorithm optimizes convex functions with noisy evaluations in one dimension.

problem Optimizing convex functions with noisy zero-order evaluations in one dimension.
method Proposed a computationally efficient algorithm achieving O(1/T)O(1/\sqrt{T}) convergence rate.
result Achieved the optimal O(1/T)O(1/\sqrt{T}) convergence rate, closing the gap in one dimension.

In this paper we study the behavior of solutions of a second order differential equation. The existence of a zero and its localization allow us to get some compactness results. In particular we obtain a Myers' type theorem even in the presence of an amount of negative curvature. The technique we use also applies to the…

2010-02-10abs ↗pdf ↗

This paper shows how to create quadratic differentials with any given singularities.

problem Creating quadratic differentials with prescribed singularities.
method Using the flat metric induced by the differentials, the authors classify and construct quadratic differentials with specific singularities.
result Every pattern of local invariants can be obtained by a quadratic differential on some Riemann surface, with exceptions in genera zero and one.

Algorithm learns causal structures from low-order conditional independencies.

problem Estimating high-order conditional independencies from data is challenging.
method Proposes an algorithm to compute a faithful graphical representation from low-order conditional independencies.
result Algorithm successfully learns causal structures from zero- and first-order conditional independencies.

We analyze the theory of optimal investment in risky assets, developed recently by Marsili, Maslov and Zhang [Physica A 253 (1998) 403]. When the real data are used instead of abstract stochastic process, it appears that a non-trivial investment strategy is rarely possible. We show that non-zero transaction costs make …

1999-05-05abs ↗pdf ↗

Flooding prevents deep networks from achieving zero training loss, improving test performance.

problem Deep networks can achieve zero training error but often have zero training loss, leading to overconfidence and poor test performance.
method Flooding prevents training loss from reaching zero by applying gradient ascent when loss is below a preset flood level.
result Flooding improves test performance and induces a double descent curve of the test loss.

Most modern financial markets use a continuous double auction mechanism to store and match orders and facilitate trading. In this paper we develop a microscopic dynamical statistical model for the continuous double auction under the assumption of IID random order flow, and analyze it using simulation, dimensional analy…

2002-10-22abs ↗pdf ↗

The class of second order ODE's cubic with respect to the first order derivative is considered. Using geometric structures associated with these equations, the subclasses of umbilical equations, zero mean curvature equations, and zero Gaussian curvature equations are defined. Zero mean curvature equations are studied w…

2017-05-18abs ↗pdf ↗

We extend the Heegaard Floer homological definition of spectral order for closed contact 3-manifolds due to Kutluhan, Matić, Van Horn-Morris, and Wand to contact 3-manifolds with convex boundary. We show that the order of a codimension zero contact submanifold bounds the order of the ambient manifold from above. As the…

2016-01-21abs ↗pdf ↗

Study meromorphic k-differentials with prescribed singularities on Riemann surfaces.

problem Understanding local invariants of meromorphic k-differentials on Riemann surfaces.
method Analyzing orders of zeros and poles, and k-residues at poles.
result For a given pattern of zeros, there exists a primitive holomorphic k-differential with these zeros.

We introduce a novel approach for training adversarial models by replacing the discriminator score with a bi-modal Gaussian distribution over the real/fake indicator variables. In order to do this, we train the Gaussian classifier to match the target bi-modal distribution implicitly through meta-adversarial training. W…

2017-07-02abs ↗pdf ↗

This paper establishes non-asymptotic oracle inequalities for the prediction error and estimation accuracy of the LASSO in stationary vector autoregressive models. These inequalities are used to establish consistency of the LASSO even when the number of parameters is of a much larger order of magnitude than the sample …

2013-11-04abs ↗pdf ↗

We show that a tensor field of any rank integrates to zero over all broken rays if and only if it is a symmetrized covariant derivative of a lower order tensor which satisfies a symmetry condition at the reflecting part of the boundary and vanishes on the rest. This is done in a geometry with non-positive sectional cur…

2018-05-13abs ↗pdf ↗

Compensation methods correct overestimation of adversarial robustness in neural networks.

problem Overestimation of adversarial robustness using first-order attack methods.
method Proposed compensation methods address inaccurate gradient computation and reduce backpropagations.
result Empirical evaluation of adversarial robustness is improved with these methods.

Study optimizes zero-order strongly convex function minimization with higher order smoothness.

problem Optimizing a strongly convex function with noisy evaluations.
method Randomized approximation of projected gradient descent with smoothing kernel.
result Upper bounds and minimax lower bounds for the algorithm, showing near-optimality.

Study analyzes symmetric two-armed Bernoulli bandit problem with zero mean gap.

problem Analyzing symmetric two-armed Bernoulli bandit problem with zero mean gap.
method Associated with a solution of a linear heat equation, compute leading order terms of minmax optimal regret and pseudoregret.
result Explicitly compute leading order terms in three scaling regimes for the gap.

A continuing mystery in understanding the empirical success of deep neural networks is their ability to achieve zero training error and generalize well, even when the training data is noisy and there are more parameters than data points. We investigate this overparameterized regime in linear regression, where all solut…

2019-03-21abs ↗pdf ↗

The paper analyzes the efficiency of gradient estimation methods in noisy function evaluations.

problem Estimating gradients of smooth functions using noisy function evaluations.
method Information-theoretic lower bounds and finite difference method analysis.
result The finite difference method is not minimax optimal, suggesting room for improvement in gradient estimation.

In this paper, we prove that the even solution of the mean field equation Δu=λ(1eu)Δu=λ(1-e^u) on S2S^2 must be axially symmetric when 4<λ84<λ\leq 8. In particular, zero is the only even solution for λ=6λ=6. This implies the rigidity of Hawking mass for stable constant mean curvature(CMC) sphere with even symmetry.

2017-06-21abs ↗pdf ↗

CyBeR-0 optimizes federated learning with Byzantine resilience and reduced communication costs.

problem Byzantine attacks and communication inefficiency in federated learning.
method Transformed robust aggregation for zero-order optimization under client heterogeneity.
result CyBeR-0 achieves stable performance with minimal communication costs and reduced memory usage.

The paper calculates area Siegel--Veech constants for specific submanifolds of REL zero.

problem Calculating area Siegel--Veech constants for affine invariant submanifolds of REL zero.
method Using volumes of the principal boundary strata and intersection theory.
result Proves a conjectural formula for the area Siegel--Veech constant in the case of REL zero.

Knowledge distillation deals with the problem of training a smaller model (Student) from a high capacity source model (Teacher) so as to retain most of its performance. Existing approaches use either the training data or meta-data extracted from it in order to train the Student. However, accessing the dataset on which …

2019-05-20abs ↗pdf ↗

Geometric phases describe how in a continuous-time dynamical system the displacement of a variable (called phase variable) can be related to other variables (shape variables) undergoing a cyclic motion, according to an area rule. The aim of this paper is to show that geometric phases can exist also for discrete-time sy…

2016-03-17abs ↗pdf ↗

In this paper we provide a family of algebraic space-like surfaces in the three dimensional anti de Sitter space that shows that this Lorentzian manifold admits algebraic maximal examples of any order. Then, we classify all the space-like order two algebraic maximal hypersurfaces in the anti de Sitter NN-dimensional s…

2009-03-13abs ↗pdf ↗

We study the local invariants that a meromorphic kk-differential on a Riemann surface of genus g0g\geq0 can have. These local invariants are the orders of zeros and poles, and the kk-residues at the poles. We show that for a given pattern of orders of zeroes, there exists, up to a few exceptions, a primitive kk-diff…

2017-05-09abs ↗pdf ↗

A new gradient estimator for online optimization with two function evaluations.

problem Online optimization of convex and Lipschitz functions with noisy data.
method L1-randomization approach for gradient estimation.
result Compared or better guarantees than previous methods for canceling noise.

We consider distributed statistical optimization in one-shot setting, where there are mm machines each observing nn i.i.d. samples. Based on its observed samples, each machine then sends an O(log(mn))O(\log(mn))-length message to a server, at which a parameter minimizing an expected loss is to be estimated. We propose an alg…

2019-11-02abs ↗pdf ↗