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

12.5%25.0%37.5%50.0% · Dec 199319922001200920182026
48 results for partial sums

In this paper, we shall prove that any Heegaard splitting of a \partial-reducible 3-manifold MM, say M=WVM=W\cup V, can be obtained by doing connected sums, boundary connected sums and self-boundary connected sums from Heegaard splittings of nn manifolds M1,...,MnM_{1},..., M_{n} where MiM_{i} is either a solid torus or a $…

2004-09-26abs ↗pdf ↗

Let MM be a surface sum of 3-manifolds M1M_1 and M2M_2 along a bounded connected surface FF and i\partial_i be the component of Mi\partial M_i containing FF. If MiM_i has a high distance Heegaard splitting, then any minimal Heegaard splitting of MM is the amalgamation of those of M1,M2M^1, M^2 and MM^*, where $M^i=M…

2008-06-18abs ↗pdf ↗

The authors prove that the logarithmic Monge-Ampère flow with uniformly bound and convex initial data satisfies uniform decay estimates away from time t=0t=0. Then applying the decay estimates, we conclude that every entire classical strictly convex solution of the equation {equation*} \det D^{2}u=\exp\{n(-u+1/2\sum_{i=…

2009-11-15abs ↗pdf ↗

Log-concavity proven for multinomial likelihoods under specific constraints.

problem Log-concavity of multinomial likelihoods under interval censoring constraints.
method Proved log-concavity by showing M-convex subsets of the discrete simplex.
result Likelihood function is completely log-concave.

The paper develops algorithms for competitive RL in partially observable MGs.

problem Challenges in reinforcement learning with function approximation and partial observability.
method Proposes posterior sampling methods for self-play and adversarial learning in zero-sum MGs.
result Developed algorithms achieve low regret bounds scaling sublinearly with GEC and episode number.

It is shown that any smooth strictly convex global solution of det(2uξiξj)=exp{i=1ndiuξid0},\det(\frac{\partial^{2}u}{\partial ξ_{i}\partial ξ_{j}}) = \exp \left\{-\sum_{i=1}^n d_i \frac{\partial u}{\partial ξ_{i}} - d_0\right\}, where d0d_0, d1d_1,...,dnd_n are constants, must be a quadratic polynomial. This extends a well-known theorem of Jö…

2007-10-19abs ↗pdf ↗

Let uu be a positive solution of the ultraparabolic equation \begin{equation*} \partial_t u=\sum_{i=1}^n \partial_{x_i}^2 u+\sum_{i=1}^k x_i\partial_{x_{n+i}}u \hspace{8mm} \mbox{on} \hspace{4mm} \mathbb{R}^{n+k}\times (0,T), \end{equation*} where 1kn1\leq k\leq n and 0<T+0<T \leq +\infty. Assume that uu and its derivat…

2013-06-20abs ↗pdf ↗

Homotopy theory for (2n+1)(2n+1)-dimensional manifold triads with fixed boundary.

problem Classifying stable moduli spaces of (2n+1)(2n+1)-dimensional manifold triads.
method Homotopy-theoretic description of stable moduli spaces, stabilization by boundary connected sum with SnimesDn+1S^n imes D^{n+1}.
result Established homology of stable moduli spaces for (2n+1)(2n+1)-dimensional manifold triads.

The paper studies hyperkähler structures and adapted complex structures using the Monge-Ampère equation.

problem Finding hyperkähler structures and adapted complex structures in tangent bundles.
method Analyzing the asymptotic expansion of the Monge-Ampère equation and using gauge transformations.
result Explicit computation of 4th order terms in the asymptotic expansion and equivalence to gauge transformations.

New method analyzes accumulation precision in deep learning networks.

problem Lack of precision analysis for accumulation in deep learning training.
method Statistical approach to analyze partial sum accumulations and derive equations for minimum required bits.
result Reduced accumulation precision can lead to loss of information and degraded network quality.

Kjolstad et. al. proposed a tensor algebra compiler. It takes expressions that define a tensor element-wise, such as fij(a,b,c,d)=exp[k=04((aik+bjk)2cii+di+k3)]f_{ij}(a,b,c,d) = \exp\left[-\sum_{k=0}^4 \left((a_{ik}+b_{jk})^2\, c_{ii} + d_{i+k}^3 \right) \right], and generates the corresponding compute kernel code. For machine learning, especially deep learni…

2017-11-03abs ↗pdf ↗

NESTA accelerates neural networks by compressing Hamming weights.

problem Efficiently computing convolution layers in deep neural networks.
method NESTA reformats convolutions into 3imes33 imes 3 batches and uses Hamming Weight Compressors to process each batch, approximating partial sums and adding residuals.
result Significantly speeds up convolution computations with reduced energy consumption.

Paper examines actor-critic methods for RL in partially observable multiagent environments.

problem Optimizing policies in partially observable multiagent settings.
method Actor-critic algorithms, focusing on policy gradient and regret minimization.
result Shows convergence guarantees and improved performance in zero-sum games.

The study counts critical points of Steklov eigenfunctions on manifolds.

problem Counting critical points of Steklov eigenfunctions on manifolds.
method Established an identity relating indexes of eigenfunctions and their restrictions to the boundary, and used it to count critical points.
result A precise count of interior critical points of Steklov eigenfunctions in terms of manifold's Euler characteristic and boundary sign changes.

We give partial boundary regularity for co-dimension one absolutely area-minimizing currents at points where the boundary consists of a sum of C1,αC^{1,α} submanifolds, possibly with multiplicity, meeting tangentially, given that the current has a tangent cone supported in a hyperplane with constant orientation vector; t…

2017-04-18abs ↗pdf ↗

Considering a Hamiltonian Dynamical System describing the motion of charged particle in a Tokamak or a Stellarator, we build a change of coordinates to reduce its dimension. This change of coordinates is in fact an intricate succession of mappings that are built using Hyperbolic Partial Differential Equations, Differen…

2013-06-24abs ↗pdf ↗

We give a new, connected-sum-like construction of Riemannian metrics with special holonomy G_2 on compact 7-manifolds. The construction is based on a gluing theorem for appropriate elliptic partial differential equations. As a prerequisite, we also obtain asymptotically cylindrical Riemannian manifolds with holonomy SU…

2000-12-19abs ↗pdf ↗

Algorithm estimates mixtures of arbitrary Gaussians robustly in presence of corruptions.

problem Estimating mixtures of arbitrary Gaussians in the presence of a constant fraction of arbitrary corruptions.
method Polynomial-time algorithm using partial clustering and tensor decomposition.
result Resolves the main open problem in several previous works on algorithmic robust statistics.

Let M denote the total space of a Lefschetz fibration, obtained by blowing up a Lefschetz pencil on an algebraic surface. We consider the n-fold fibre sum M(n), generalizing the construction of the elliptic surfaces E(n). For a Lefschetz pencil on a simply-connected minimal surface of general type we partially calculat…

2012-09-12abs ↗pdf ↗

We study nn-dimensional area-minimizing currents TT in Rn+1,\mathbb{R}^{n+1}, with boundary T\partial T satisfying two properties: T\partial T is locally a finite sum of (n1)(n-1)-dimensional C1,αC^{1,α} orientable submanifolds which only meet tangentially and with same orientation, for some α(0,1]α\in (0,1]; T\partial T has…

2018-05-02abs ↗pdf ↗

Optimizes partial AUC across various FPRs for machine learning models.

problem Lack of scalable algorithms for optimizing partial AUC in a range of FPRs.
method Formulated as a non-smooth DC program, developed an efficient approximated gradient descent method using Moreau envelope smoothing.
result Achieved a complexity of O(1/ε6)O(1/ε^6) for finding nearly εε-critical solutions.

The study explores dimensions for connected sums of almost complex manifolds and extends results to rational homology spheres.

problem Understanding dimensions for connected sums of almost complex manifolds and extending results to rational homology spheres.
method Obstruction theory and Yang's results on almost complex structures were used to answer questions about dimensions. The index of the twisted spin^c Dirac operator was applied to extend results to rational homology spheres.
result The study partially extends Datta and Subramanian's result on the nonexistence of almost complex structures on products of two even spheres to rational homology spheres.

Study the boundary operator property on simplicial complexes, proving essential properties for Hodge theory.

problem Characterize the boundary operator property =0\partial\partial = 0 on simplicial complexes.
method Characterization in 2\ell^2 terms of recurrence of links, defining relative cohomology, and proving harmonic eigenforms.
result Essential properties for Hodge theory, including weak decomposition and existence of harmonic eigenforms.

This paper characterizes Lie symmetries for a general Lienard-type equation.

problem Characterizing Lie symmetries for a general Lienard-type equation.
method Analyzing the Lie symmetry group of the general Lienard-type equation u¨=k=0nfku˙k\ddot{u} = \sum_{k=0}^n f_k \dot{u}^k for n4n\geq 4.
result The paper provides a condition for the existence of another Lie symmetry and characterizes when the equation admits such symmetries.

New algorithm minimizes expert selection regret in partial bandit feedback.

problem Minimizing expert selection regret in partial bandit feedback.
method Develops a sequential minimax optimal algorithm for a generalized partial monitoring setting.
result Second order regret bounds against a general expert selection sequence.

This paper considers the problem of clustering a partially observed unweighted graph---i.e., one where for some node pairs we know there is an edge between them, for some others we know there is no edge, and for the remaining we do not know whether or not there is an edge. We want to organize the nodes into disjoint cl…

2011-04-25abs ↗pdf ↗

Expanding FCCO to non-smooth weakly-convex problems, improving deep learning performance.

problem Addressing the limitations of current FCCO methods by tackling non-smooth weakly-convex problems.
method Developed a single-loop algorithm for non-smooth weakly-convex FCCO and extended it to tri-level problems.
result Established the complexity for finding ε-stationary points in the Moreau envelop of the objective function.

Let PP be a Laplace type operator acting on a smooth hermitean vector bundle VV of fiber CN\mathbb{C}^N over a compact Riemannian manifold given locally by P=[gμνu(x)μν+vν(x)ν+w(x)]P= - [g^{μν} u(x)\partial_μ\partial_ν+ v^ν(x)\partial_ν+ w(x)] where u,vν,wu,\,v^ν,\,w are MN(C)M_N(\mathbb{C})-valued functions with u(x)u(x) positive and invertible. F…

2017-07-30abs ↗pdf ↗

Study proves value of non-Markovian games with partial, asymmetric info.

problem Value of non-Markovian Dynkin games with partial and asymmetric information.
method Probabilistic and functional analytic approach based on Sion's min-max theorem.
result Existence of optimal strategies for both players in randomised stopping times.

The study computes Bergman kernels and point process asymptotics on Kähler manifolds.

problem Computing asymptotics of Bergman kernels and point process distributions on Kähler manifolds.
method Equivariant and partial Bergman kernels, determinantal point processes, asymptotic analysis.
result The distribution of linear statistics converges to a centered normal variable with specific variances.

Unified local and global explanations through functional decomposition of low dimensional structures.

problem Tackles the challenge of extracting meaningful local and global explanations from machine learning models.
method Proposes a new identification constraint to decompose the global representation into main and interaction components of arbitrary order.
result Unified local and global explanations by connecting partial dependence plots and interventional SHAP values.

We prove a homological version of a conjecture about the homotopy type of diffeomorphism spaces of reducible 3-manifolds.

problem Proving a conjecture about the homotopy type of diffeomorphism spaces of reducible 3-manifolds.
method Homological approach to show finitely many nonzero homology groups, each finitely generated.
result BDiff(M, rel ∂) has finitely many nonzero homology groups, each finitely generated, for connected sums of irreducible 3-manifolds with nontrivial and non-spherical boundaries.

The paper improves asymmetric causality tests by addressing inefficiencies and statistical significance issues.

problem Inefficiencies and statistical significance issues in asymmetric causality tests.
method Improved asymmetric causality tests via partial cumulative sums for positive and negative components, explicitly testing differences between causal parameters.
result Efficiently tested hypotheses on asymmetric causal interaction between financial markets.

This paper tackles sample-efficient reinforcement learning for partially observable Markov games.

problem Learning in partially observable Markov games with incomplete information.
method A simple algorithm combining optimism and Maximum Likelihood Estimation (MLE) for self-play, and a variant of optimistic MLE for adversarial opponents.
result The proposed algorithms achieve approximate Nash, correlated, and coarse correlated equilibria in polynomial samples for weakly revealing POMGs.

The state sums defining the quantum hyperbolic invariants (QHI) of hyperbolic oriented cusped 33-manifolds can be split in a "symmetrization" factor and a "reduced" state sum. We show that these factors are invariants on their own, that we call "symmetry defects" and "reduced QHI", provided the manifolds are endowed w…

2015-06-03abs ↗pdf ↗