Wave trace singularity formula for fibre bundles generalizes Poisson summation.
problem Wave trace singularity formula for fibre bundles.
method Proved a wave trace singularity formula for a family of generalised Laplacians defined by a Riemannian fibre bundle.
result Generalizes Poisson summation formulae for families.
Mathematical structures link Gromov-Witten to Donaldson-Thomas invariants.
problem Understanding non-perturbative topological string theory.
method Borel summation of Gromov-Witten potential and analysis of Stokes phenomena.
result Stokes phenomena encode Donaldson-Thomas invariants of the resolved conifold.
Paper extends trigonometric summation formula with weights.
problem Trigonometric summation formula by Grigor'yan, Lin and Yau.
method Weighted trigonometric summation formula derivation.
result Extension of trigonometric summation formula.
Finet uses FBN for efficient, lightweight neural networks.
problem Building efficient neural networks with limited computational resources.
method Introduces Fine-grained Batch Normalization (FBN) and a novel light-weight network (Finet) that combines FBN with standard convolution.
result Finet achieves state-of-the-art performance on ImageNet classification with reduced computational complexity.
Improved privacy-preserving summation protocol with fewer messages.
problem Achieving efficient differential privacy in multi-party summation.
method Combining secure shuffling with Laplace mechanism in the shuffle model.
result Protocol with O(1/ε) error and O(log(n/δ)) messages per party. We provide faster algorithms for the problem of Gaussian summation, which occurs in many machine learning methods. We develop two new extensions - an O(Dp) Taylor expansion for the Gaussian kernel with rigorous error bounds and a new error control scheme integrating any arbitrary approximation method - within the best …
The study shows how certain ODEs and integrals are regular under Borel summation.
problem Analyzing the regularity of solutions to ODEs and integration problems.
method Using geometric perspective on Laplace and Borel transforms, the study examines level 1 ODEs and exponential period integrals over Lefschetz thimbles.
result Solutions of certain ODEs and integration problems are Borel regular.
F. Jaeger presented the two-variable Kauffman polynomial of an unoriented link L as a weighted sum of HOMFLY-PT polynomials of oriented links associated with L. Murakami, Ohtsuki and Yamada (MOY) used planar graphs and a recursive evaluation of these graphs to construct a state model for the sl(n)-link invariant (a one…
We consider fast kernel summations in high dimensions: given a large set of points in d dimensions (with d≫3) and a pair-potential function (the {\em kernel} function), we compute a weighted sum of all pairwise kernel interactions for each point in the set. Direct summation is equivalent to a (dense) matrix-vec…
This paper is an introduction to Khovanov homology, starting with the Kauffman bracket state summation, emphasizing the Bar-Natan Canopoloy and tangle cobordism approach. The paper discusses a simplicial approach to Khovanov homology and a quantum model for it so that the graded Euler characteristic that produces the J…
New theorem shows every integer can be represented by knot summation.
problem Understanding the summation of knot coefficients.
method Analyzing spatial complete graphs and Hamiltonian knots.
result Every integer can be represented by knot summation.
This paper is an introduction to the state sum model for the Alexander-Conway polynomial that was introduced in the the author's book "Formal Knot Theory" (Princeton University Press, 1983). The article outlines how Alexander's original definition of the polynomial as the determinant of a matrix associated with the lin…
We extend knot Floer homology to string links in D^{2} \times I and to d-based links in arbitrary three manifolds, without any hypothesis on the null-homology of the components. As for knot Floer homology we obtain a description of the Euler characteristic of the resulting homology groups (in D^{2} \times I) in terms o…
Improved greedy 2-coordinate updates for optimization problems with constraints.
problem Minimizing smooth functions subject to constraints.
method Exploiting a connection to steepest descent in the 1-norm, we give faster convergence rates and efficient computation.
result Greedy selection converges faster than random selection and can be computed in O(nlogn) time. Kernel density estimation (KDE) is a popular statistical technique for estimating the underlying density distribution with minimal assumptions. Although they can be shown to achieve asymptotic estimation optimality for any input distribution, cross-validating for an optimal parameter requires significant computation do…
A new method slices and sums radial kernels faster.
problem Fast computation of large kernel sums in kernel methods.
method Random projections to 1D subspaces and QMC for selecting projections.
result QMC-slicing outperforms existing methods on test datasets.
The paper presents a series representation for European option pricing driven by fractional diffusion.
problem Pricing European options under space-time fractional diffusion.
method Uses Mellin-Barnes representation and residue summation in the complex plane.
result Derives a rapidly convergent double-series formula for option pricing.
Paper introduces VSSGD to balance deep learning training with variance suppression.
problem Unbalanced data leads to unbalanced training process in deep learning.
method Adaptively adjusts error variance and mean to balance training.
result VSSGD accelerates training, prevents overfitting, and improves learning from small samples.
Quantum dilogarithm function proven from a linear difference equation.
problem Proving Faddeev's quantum dilogarithm from a linear difference equation.
method Proved Faddeev's quantum dilogarithm using Borel summation of a formal power series solution of a linear difference equation.
result Borel summation of a formal power series solution produces Faddeev's quantum dilogarithm.
New techniques improve 16-bit training accuracy without 32-bit units.
problem Training deep learning models with only 16-bit floating-point units.
method Studied BFloat16 units and applied stochastic rounding and Kahan summation techniques.
result Up to 7% absolute validation accuracy gain in 16-bit-FPU training.
The paper extends quantum link invariants to rotational virtual knots and links.
problem Understanding quantum invariants for rotational virtual knots and links.
method Established background virtual knot theory, defined rotational virtual knots, and introduced extensions of quantum link invariants.
result A non-trivial link L is not detected by any quantum invariant formulated in this paper.
Dirichlet-Neumann duality for Riemannian submersions
problem Spectral geometry of Riemannian submersions
method Summation formula for reciprocal of basic Dirichlet eigenvalues
result Supersymmetric duality between basic Dirichlet and Neumann spectra
This paper reviews state-of-the-art mixed data clustering algorithms.
problem Clustering mixed data is challenging due to the difficulty in applying mathematical operations to feature values.
method Taxonomy and state-of-the-art review of mixed data clustering algorithms.
result Identification of five major research themes and analysis of strengths and weaknesses of methods.
For an eigenfunction of the Laplacian on a hyperbolic Riemann surface, the coefficients of the Fourier expansion are described as intertwining functionals. All intertwiners are classified. A refined growth estimate for the coefficients is given and a summation formula is proved.
We prove an explicit formula of the Berezin star product on Kaehler manifolds. The formula is expressed as a summation over certain strongly connected digraphs. The proof relies on a combinatorial interpretation of Englis' work on the asymptotic expansion of the Laplace integral.
Two categorifications are given for the arrow polynomial, an extension of the Kauffman bracket polynomial for virtual knots. The arrow polynomial extends the bracket polynomial to infinitely many variables, each variable corresponding to an integer {\it arrow number} calculated from each loop in an oriented state summa…
A lightweight model predicts IT system KPIs from historical data.
problem Predicting future KPIs of interconnected IT systems is hard due to diverse and changing components.
method A weighted heterogeneous ensemble method combining neural network and mean predictor.
result Achieved R2 scores of 0.10 and 0.15 on test data. New techniques prove quantum modularity for various functions.
problem Proving quantum modularity of false theta functions and related series.
method Developed techniques including Poisson summation formula and modular series framework.
result Unified approach to proving quantum modularity for various functions.
For the Möbius spheres Sq,p, we give alternative elementary proofs of the recursive formulas for GJMS-operators and Q-curvatures due to the first author [Geom. Funct. Anal. 23, (2013), 1278-1370; arXiv:1108.0273]. These proofs make essential use of the theory of hypergeometric series.
Paper develops probabilistic bounds for a stochastic gradient algorithm in non-convex problems.
problem Stochastic optimization in non-convex finite sum problems.
method Develops a new dimension-free Azuma-Hoeffding type bound for a martingale difference sequence.
result Empirical results show superior probabilistic performance of Prob-SARAH compared to other algorithms.
New method improves probabilistic model inference.
problem Computing partition function is hard and variational methods often fail.
method Sequential summation over variables with mini-bucket elimination and renormalization.
result Robust approximate algorithms show good performance on various models.
In this paper, we study some vanishing identities for Gromov-Witten invariants conjectured by K. Liu and H. Xu. We will prove these conjectures in the case that the summation range is large compare to genus. In fact, in such cases, we can obtain a vanishing identity which is stronger than their conjectures. Moreover we…
VRSMD improves SMD convergence and has implicit regularization.
problem Efficiently estimating models with large datasets.
method Variance reduction in stochastic mirror descent.
result VRSMD converges to the minimum mirror interpolant.
Given a measured lamination on a finite area hyperbolic surface we consider a natural measure Mon the real line obtained by taking the push-forward of the volume measure of the unit tangent bundle of the surface under an intersection function associated with the lamination. We show that the measure M gives summation id…
Observational data usually comes with a multimodal nature, which means that it can be naturally represented by a multi-layer graph whose layers share the same set of vertices (users) with different edges (pairwise relationships). In this paper, we address the problem of combining different layers of the multi-layer gra…
Paper proposes a new method to efficiently incorporate curvature information in stochastic optimization.
problem Minimizing nonconvex functions with limited curvature information.
method Structured stochastic quasi-Newton method using partial Hessian information.
result Global convergence to stationary point and local superlinear convergence rate established.
Study of Penner's cocycle on fatgraph complex.
problem Understanding Penner's cocycle on fatgraph complex.
method Explicit cobounding cochain formula involving summation over trivalent vertices.
result Expressed symplectic form of surface underlying fatgraph.
This paper solves the open problem of computing Bayes optimal prediction for decision trees using a Markov chain Monte Carlo method.
problem Computing the Bayes optimal prediction for decision trees is infeasible due to an infeasible summation over all division patterns of a feature space.
method Solved the open problem using a Markov chain Monte Carlo method with adaptively tuned step size.
result Computed the Bayes optimal prediction for decision trees using a Markov chain Monte Carlo method.
This paper defines a new invariant of virtual knots and links that we call the extended bracket polynomial, and denote by <<K>> for a virtual knot or link K. This invariant is a state summation over bracket states of the oriented diagram for K. Each state is reduced to a virtual 4-regular graph in the plane and the pol…
Paper analyzes Winograd convolution errors and proposes methods to reduce them.
problem Reduction of floating point error in Winograd convolution for deep neural networks.
method Analysis of worst case FP error, estimation of norm and conditioning, proposed evaluation orderings, sampling points selection, mixed-precision convolution, pairwise summation.
result Proposed methods significantly reduce FP error for a given block size, allowing larger block sizes and reduced computation.
TaLK Convolutions improve sequence modeling efficiency.
problem Efficiently modeling sequences with limited time complexity.
method Adaptive convolution operation that learns kernel size.
result Time complexity reduced to O(n), making sequence encoding linear. The paper tackles non-cumulative objectives in reinforcement learning and proposes modifications to existing algorithms.
problem Optimizing objectives that are not naturally expressed as summations of rewards in various fields.
method The paper modifies the Bellman optimality equation to handle non-cumulative objectives by replacing summation with a generalized operation.
result The modified Bellman updates can converge to the globally optimal solution under certain conditions.
Improves accuracy of SMCI estimators without expanding sum regions.
problem Intractable multiple summations in evaluating expectations on the Ising model.
method Combining multiple SMCI estimators using generalized least squares (GLS).
result The proposed method can improve accuracy without combinatorial explosion.
The paper develops a method for forecasting power consumption at various levels of aggregation.
problem Forecasting power consumption at different levels of household aggregation.
method Three-step process: feature generation, aggregation, and projection.
result The method provides theoretical guarantees on prediction error and performs well on real data.
Combining differential privacy and federated learning improves data security.
problem Ensuring privacy in distributed machine learning.
method Integrating differential privacy with federated learning protocols.
result Achieved comparable prediction accuracy to non-distributed learning while maintaining strict privacy.
CAMul forecasts with calibrated and accurate multi-view time-series data.
problem Combining diverse data sources for reliable time-series forecasting.
method CAMul integrates multi-modal data views dynamically, assigning importance based on context.
result CAMul outperforms state-of-the-art models by 25% in accuracy and calibration.
New function found with spherical harmonic divergent sums almost everywhere.
problem Divergence of spherical harmonic expansions almost everywhere.
method Study of Cesàro, Riesz, and Bochner-Riesz means.
result Found an integrable function whose means diverge almost everywhere.
Improves Monte-Carlo simulations for consistent mean and variance.
problem Artificial randomness in running mean calculations.
method Combining running mean and variance with accurate summing.
result Increased accuracy and robustness of Monte-Carlo estimates.