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.

169,051 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Dec 199219922001200920182026
48 results for common zeros

This study calculates the average number of common zeros of holomorphic functions on complex manifolds.

problem Calculating the average number of common zeros of holomorphic functions.
method Defined a Hermitian mixed volume for a mix of non-negative Hermitian forms and proved the average number of common zeros equals this mixed volume.
result The average number of common zeros of holomorphic functions equals the mixed volume of the manifold.

ZSL-KG learns class representations from common sense knowledge graphs.

problem Predicting classes without labeled examples using semantic class representations.
method TrGCN, a novel transformer graph convolutional network, embeds nodes from common sense knowledge graphs in a vector space.
result ZSL-KG improves over existing methods on five out of six zero-shot benchmark datasets.

We consider the eigenfunctions of the Laplace operator ΔΔ on a compact Riemannian manifold of dimension nn. For MM homogeneous with irreducible isotropy representation and for a fixed eigenvalue of ΔΔ we find the average number of common zeros of nn eigenfunctions. For this we compute the volume of the image of $M…

2016-05-24abs ↗pdf ↗

A new model generates samples with a succinct common representation using Wyner's common information.

problem Generating samples with a succinct common representation.
method Proposes a variational Wyner model trained to minimize symmetric Kullback-Leibler divergence with regularization terms.
result Demonstrates utility through joint and conditional generation experiments.

High-dimensional shrinkage risk depends on the default prior for the common scale.

problem Choosing the default prior for the common scale in high-dimensional shrinkage.
method Using radial-power benchmark to compare variance-flat and standard deviation-flat priors.
result The standard deviation-flat prior has a one-unit asymptotic risk advantage near the origin.

We first construct a genus zero positive allowable Lefschetz fibration over the disk (a genus zero PALF for short) on the Akbulut cork and describe the monodromy as a positive factorization in the mapping class group of a surface of genus zero with five boundary components. We then construct genus zero PALFs on infinit…

2014-06-23abs ↗pdf ↗

A composite loss framework is proposed for low-rank modeling of data consisting of interesting and common values, such as excess zeros or missing values. The methodology is motivated by the generalized low-rank framework and the hurdle method which is commonly used to analyze zero-inflated counts. The model is demonstr…

2017-09-06abs ↗pdf ↗

ZICO learns DAGs from zero-inflated count data efficiently.

problem Learning network structures from zero-inflated count data.
method ZICO uses node-wise likelihoods with canonical links and a differentiable surrogate constraint for acyclicity.
result ZICO achieves superior performance and faster runtimes on simulated data.

We formulate a theory of pointed manifolds, accommodating both embeddings and Pontryagin-Thom collapse maps, so as to present a common generalization of Poincaré duality in topology and Koszul duality in En\mathcal{E}_n-algebra.

2014-09-09abs ↗pdf ↗

CLAREL improves zero-shot learning by using per-image semantic supervision and metric rescaling.

problem Fine-grained cross-modal representation learning for zero-shot classification.
method Instance-based deep metric learning in joint visual and textual space, using per-image semantic supervision and metric rescaling.
result CLAREL consistently outperforms existing approaches on fine-grained zero-shot learning datasets.

Study Bergman kernels and zero distributions of random sections on Kähler manifolds.

problem Asymptotic distribution of common zeros of random sections on Kähler manifolds.
method Analysis of Bergman kernels and equidistribution for sequences of line bundles.
result Established asymptotic expansion of Bergman kernels and equidistribution of zeros.

A vector field X on a manifold M with possibly nonempty boundary is inward if it generates a unique local semiflow ΦXΦ^X. A compact relatively open set K in the zero set of X is a block. The Poincaré-Hopf index is generalized to an index for blocks that may meet the boundary. A block with nonzero index is essential. Le…

2012-04-05abs ↗pdf ↗

Let LL be a holomorphic line bundle over a compact Kähler manifold XX endowed with a singular Hermitian metric hh with curvature current c1(L,h)0c_1(L,h)\geq0. In certain cases when the wedge product c1(L,h)kc_1(L,h)^k is a well defined current for some positive integer kdimXk\leq\dim X, we prove that c1(L,h)kc_1(L,h)^k can be approxima…

2013-02-01abs ↗pdf ↗

We consider constant mean curvature surfaces of finite topology, properly embedded in three-space in the sense of Alexandrov. Such surfaces with three ends and genus zero were constructed and completely classified by the authors in arXiv:math.DG/0102183. Here we extend the arguments to the case of an arbitrary number o…

2005-09-09abs ↗pdf ↗

On a smooth line bundle LL over a compact Kähler Riemann surface ΣΣ, we study the family of vortex equations with a parameter ss. For each s[1,]s \in [1,\infty], we invoke techniques in \cite{Br} by turning the ss-vortex equation into an ss-dependent elliptic partial differential equation, studied in \cite{kw}, provi…

2013-01-08abs ↗pdf ↗

Paper studies competitive networks where teams aim to minimize their own objectives, adapting to each other's strategies.

problem Competitive networks where teams have conflicting objectives.
method Proposes diffusion learning algorithms for two classes of network games: zero-sum and non-zero-sum.
result Stability performance of proposed algorithms analyzed and demonstrated through experiments.

We show that normalized currents of integration along the common zeros of random mm-tuples of sections of powers of mm singular Hermitian big line bundles on a compact Kähler manifold distribute asymptotically to the wedge product of the curvature currents of the metrics. If the Hermitian metrics are Hölder with sing…

2015-06-04abs ↗pdf ↗

We show that every smooth closed oriented four-manifold admits a decomposition into two co- dimension zero submanifolds with common boundary. Each of these submanifolds carries a structure of a symplectic manifold with pseudo-convex boundary. This imply, in particular, that every smooth closed simply-connected four-man…

2000-10-16abs ↗pdf ↗

The paper addresses score-mismatched diffusion models and zero-shot conditional samplers.

problem Theoretical guarantees for score-mismatched diffusion models in zero-shot conditional sampling.
method Theoretical analysis of score-mismatched diffusion models and zero-shot conditional samplers.
result Theoretical performance guarantees with explicit dimensional dependencies for score-mismatched diffusion samplers.

Stochastic neural networks with infinite width become deterministic, reducing training variance.

problem Understanding how stochasticity in neural networks affects learning and regularization.
method Theoretical analysis of stochastic neural networks with infinite width.
result As the width of an optimized stochastic neural network increases, its predictive variance on the training set decreases to zero.

HIP method extended to multi-class, Poisson, and Zero-Inflated Poisson outcomes with an R Shiny app.

problem Subgroup heterogeneity in complex diseases like COPD.
method Integrating multiple data views while accounting for subgroup heterogeneity.
result Identified common and subgroup-specific markers of exacerbation frequency in males and females.

New insights into neural network training show some interpolating methods can generalize well, while others fail catastrophically.

problem Understanding why neural networks trained to interpolate can still generalize well or fail catastrophically.
method Analyzing empirical risk minimization (ERM) over large hypotheses classes, focusing on interpolating methods.
result Some interpolating ERM-like methods for large hypotheses classes provide good statistical guarantees, while others fail catastrophically.

This work proposes using zero-variance control variates to reduce variance in pathwise gradient estimators for variational inference.

problem Pathwise gradient estimators in variational inference have high variance, leading to inefficient optimization.
method Apply zero-variance control variates to pathwise gradient estimators.
result Zero-variance control variates can significantly reduce the variance of pathwise gradient estimators without requiring complex assumptions.

In this article we show that every closed oriented smooth 4-manifold can be decomposed into two codimension zero submanifolds (one with reversed orientation) so that both pieces are exact Kahler manifolds with strictly pseudoconvex boundaries and that induced contact structures on the common boundary are isotopic. Mean…

2006-01-17abs ↗pdf ↗

In this paper we will show that the generalized connected sum construction for constant scalar curvature metrics can be extended to the zero scalar curvature case. In particular we want to construct solutions to the Yamabe equation on the generalized connected sum M = M_1 (\sharp_K) M_2 of two compact Riemannian manifo…

2006-11-25abs ↗pdf ↗

Let XX be an nn-dimensional manifold and V1,,VnC(X,R)V_1, \ldots, V_n \subset C^\infty(X, \mathbb R) finite-dimensional vector spaces with Euclidean metric. We assign to each ViV_i a Finsler ellipsoid, i.e., a family of ellipsoids in the fibers of the cotangent bundle of XX. We prove that the average number of isolated common…

2018-02-08abs ↗pdf ↗

Obtaining common representations from different modalities is important in that they are interchangeable with each other in a classification problem. For example, we can train a classifier on image features in the common representations and apply it to the testing of the text features in the representations. Existing m…

2016-12-23abs ↗pdf ↗

Deep Reinforcement Learning (deep RL) has made several breakthroughs in recent years in applications ranging from complex control tasks in unmanned vehicles to game playing. Despite their success, deep RL still lacks several important capacities of human intelligence, such as transfer learning, abstraction and interpre…

2018-04-23abs ↗pdf ↗

New technique trains deep neural networks without normalization or minibatch statistics.

problem Training deep neural networks at high learning rates without normalization.
method Channel-wise zero-mean initialization and gradient modification to maintain common mode rejection.
result Achieves higher accuracy compared to batch normalization and shows minibatches are unnecessary.

It is shown that, on a compact Kahler manifold with boundary, the singularities of the pluricomplex Green's function with multiple poles can be prescribed to be of the form logj=1nfj(z)2\log\sum_{j=1}^n|f_j(z)|^2 at each pole, where fj(z)f_j(z) are arbitrary local holomorphic functions with the pole as their only common zero. The pr…

2012-09-11abs ↗pdf ↗

A new topology design improves zero-shot classification performance in contrastive learning.

problem Improving zero-shot classification performance in contrastive visual-textual alignment.
method Proposed an alternative topology design using multiple class tokens and an oblique manifold with negative inner product.
result Improves zero-shot classification performance by an average of 6.1%.

New method improves mHealth user engagement using Thompson sampling for count data.

problem Optimizing mHealth interventions for distal outcomes through proximal context.
method Combines count data models with Thompson sampling for contextual bandits.
result Improves user engagement in mHealth trials compared to existing methods.

Study shows adversarial attacks can fool speech-to-text models, and PCA is ineffective as a defense.

problem Adversarial attacks can mislead speech-to-text neural networks.
method Crafted adversarial waveforms, used PCA for defense, tested under black-box setting.
result PCA is ineffective as a defense mechanism against adversarial attacks in audio domain.

We analyze the errors arising from discrete readjustment of the hedging portfolio when hedging options in exponential Levy models, and establish the rate at which the expected squared error goes to zero when the readjustment frequency increases. We compare the quadratic hedging strategy with the common market practice …

2010-03-03abs ↗pdf ↗

In high-dimensional linear models, the sparsity assumption is typically made, stating that most of the parameters are equal to zero. Under the sparsity assumption, estimation and, recently, inference have been well studied. However, in practice, sparsity assumption is not checkable and more importantly is often violate…

2016-10-07abs ↗pdf ↗