In this paper we develop the theory of parametric polynomial regression in Riemannian manifolds and Lie groups. We show application of Riemannian polynomial regression to shape analysis in Kendall shape space. Results are presented, showing the power of polynomial regression on the classic rat skull growth data of Book…
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
48 results for “polynomial analysis”
Proves volume conjecture for twist knots using complex analysis.
problem Volume conjecture for twist knots.
method Equivalence relation, complex analysis, analytic continuation, function of several complex variables.
result Proves volume conjecture for twist knots.
Polynomial-time methods count and sample DAGs from equivalence classes.
problem Counting and sampling DAGs from Markov equivalence classes.
method Polynomial-time algorithms for DAGs.
result Counting and sampling can be done in polynomial time.
Study uses big data to analyze quantum invariants.
problem Investigate structural properties of Jones polynomial.
method Exploratory and topological data analysis, including coloring, rank increase, categorification.
result Contrasts behavior of Jones polynomial under various enhancements.
Paper analyzes sample complexity of polynomial neural networks.
problem Understanding the sample complexity of polynomial neural networks.
method Extends previous literature to polynomial neural networks and analyzes sample complexity.
result Obtains novel results on sample complexity of polynomial neural networks.
Study on factorizations of knot polynomials for up to 12 crossings.
problem Understanding factorizations of HOMFLY polynomials for knots and links.
method Computer analysis of knots up to 12 crossings; irreducibility criterion for 2-connected plane graphs.
result Found 17 non-trivial factorizations of knots with up to 12 crossings.
New knot models analyze local entanglement for robust curve analysis.
problem Lack of local structural information in classical knot theory.
method Proposed multiscale and persistent Jones polynomials.
result Models are stable to small perturbations, robust for real-world applications.
Smoothed analysis is a powerful paradigm in overcoming worst-case intractability in unsupervised learning and high-dimensional data analysis. While polynomial time smoothed analysis guarantees have been obtained for worst-case intractable problems like tensor decompositions and learning mixtures of Gaussians, such guar…
Polynomial-time methods count and sample DAGs from Markov classes.
problem Counting and sampling Markov equivalent DAGs.
method Polynomial-time algorithms for DAGs from Markov classes.
result Long-standing open problem solved, making practical infeasible strategies feasible.
Constructive Approximation under Carleman's Condition, with Applications to Smoothed Analysismath.PR
Quantifies polynomial approximation rates for smooth functions under various distributions.
problem Approximating smooth functions with polynomials under different distributional constraints.
method Develops a quantitative analogue of Carleman's theorem using complex analysis.
result Establishes superexponential rates of approximation for certain function classes over general distributions.
Kernel discriminant analysis uses nonlinear embeddings to improve classification.
problem Limited effectiveness of linear discriminant analysis in capturing nonlinear features.
method Study of nonlinear embeddings in kernel discriminant analysis using polynomial and Gaussian kernels, solving generalized eigenvalue problems.
result Polynomial and Gaussian discriminants capture class differences through population moments and randomized projections.
In this paper, we aim at introducing a new machine learning model, namely reconciled polynomial machine, which can provide a unified representation of existing shallow and deep machine learning models. Reconciled polynomial machine predicts the output by computing the inner product of the feature kernel function and va…
EKM solves the K-medoids problem in polynomial time.
problem The -medoids problem in data analysis.
method EKM is a novel algorithm using transformational programming and combinatorial generation.
result EKM solves the -medoids problem in worst-case $O\left(N^{K+1}
ight)$ time complexity.
We extend the exploration regarding dynamical approach of macroeconomic variables by tackling systematically expenditure using Statistical Physics models (for the first time to the best of our knowledge). Also, using polynomial distribution which characterizes the behavior of dynamical systems in certain situations, we…
Piecewise polynomial interpolation-based gradient descent reduces oracle complexity for smooth loss functions.
problem Optimizing empirical risk minimization loss functions
method Piecewise polynomial interpolation-based gradient descent
result Oracle complexity is reduced for smooth loss functions
AL-SPCE improves reliability analysis for complex systems with active learning and SPCE.
problem Efficiently analyzing reliability of complex, computationally expensive models with intrinsic randomness.
method Active learning framework using stochastic polynomial chaos expansions (SPCE) to reduce computational burden.
result AL-SPCE maintains high accuracy in reliability estimates while significantly improving efficiency.
Volterra and polynomial regression models play a major role in nonlinear system identification and inference tasks. Exciting applications ranging from neuroscience to genome-wide association analysis build on these models with the additional requirement of parsimony. This requirement has high interpretative value, but …
Researchers compute and predict knot volumes using colored Jones polynomials.
problem Computing and predicting volumes of hyperbolic knots.
method Vertex model approach, neural network training, polynomial evaluations.
result 3-colored Jones polynomials predict knot volumes with high accuracy.
Study the spectrum of Poincaré operator in triaxial ellipsoids.
problem Spectrum of the Poincaré operator in triaxial ellipsoids.
method Microlocal analysis of partial differential equations and polynomial vector fields.
result Polynomial eigenvectors and large-degree asymptotics of the operator.
Bayesian adaptive PCE method improves surrogate modeling and sensitivity analysis.
problem Lack of fully Bayesian PCE methods in statistics.
method Developed a novel fully Bayesian adaptive PCE method with R implementation.
result Bayesian adaptive PCE provides competitive performance for various UQ tasks.
Study on Monge-Ampère equations with polynomial growth rates.
problem Analyzing solutions to Monge-Ampère equations with polynomial right-hand sides.
method Utilizing polynomial growth analysis to study regularity and growth rates of solutions.
result Translators for sub-affine-critical curvature flows are smooth and convex with specific growth rates.
Study examines boundedness of oscillating singular integrals on specific Lie groups.
problem Investigating boundedness of oscillating singular integrals on Lie groups of polynomial growth.
method Presented kernel criteria in terms of sub-Riemannian structure and Fourier analysis.
result Extended classical oscillating conditions for boundedness of oscillating convolution operators.
New algorithm learns ReLU networks efficiently using Schur polynomials.
problem PAC learning a linear combination of ReLU activations under Gaussian distribution.
method Uses tensor decomposition and Schur polynomials to identify and analyze higher-order moments.
result Near-optimal sample and computational complexity for learning ReLU networks.
Unified approach to experimental design using interlacing polynomials.
problem Experimental design problems, especially D/A/E-design and E-design.
method Unified deterministic approach using interlacing polynomials.
result Improved approximation guarantees for various experimental design objectives.
Polynomial-time reachability for LTI systems with TLL NN controllers is achieved.
problem Bounding the reachable set of LTI systems controlled by TLL NN controllers.
method Polynomial-time computation of exact one-step reachable set and tight bounding box via two methods.
result Exact reachability computation in polynomial time for TLL NN controllers.
Fixed-parameter tractable computation of Reshetikhin--Turaev knot polynomials via tensor networksmath.GT
New algorithm speeds up knot polynomial calculations.
problem Computing Reshetikhin--Turaev knot polynomials efficiently.
method Fixed-parameter tractable computation via tensor networks.
result Knot polynomial computations are fixed-parameter tractable.
Local polynomial regression (Fan and Gijbels 1996) is an important class of methods for nonparametric density estimation and regression problems. However, straightforward implementation of local polynomial regression has quadratic time complexity which hinders its applicability in large-scale data analysis. In this pap…
The extragradient method accelerates convergence in complex game dynamics.
problem Complex interactions in game dynamics cause simple methods to diverge, necessitating more sophisticated approaches.
method A polynomial-based analysis to identify three scenarios for accelerated convergence of the momentum extragradient method.
result The momentum extragradient method achieves faster convergence under specific eigenvalue conditions.
Study on complexity of random polynomials with deterministic spikes, identifying phase transitions.
problem Complexity of random Gaussian polynomials with deterministic spikes on a sphere.
method Variational formulas, Kac-Rice formula, determinant asymptotics of finite-rank perturbation of Gaussian Wigner matrices.
result Identification of a topological phase transition in the complexity function.
The paper investigates polynomial alternatives to softmax in transformer models.
problem The effectiveness of softmax attention in transformers is questioned.
method The authors explore polynomial activations as alternatives to softmax, focusing on their ability to regularize the attention matrix.
result Certain polynomials can serve as effective substitutes for softmax in transformer applications, achieving strong performance.
New methods improve neural connectivity analysis at submillisecond timescales.
problem Limitations of standard spike train analysis methods in terms of temporal resolution and scalability.
method Developed Monte Carlo and polynomial approximation methods for continuous-time neural spike train analysis.
result Superior accuracy and scalability compared to traditional binned GLMs, enabling precise connectivity inference.
Polynomial-time algorithm learns high-dimensional halfspaces without labels.
problem Learning high-dimensional halfspaces with margins in polynomial time.
method Contrastive moments and polynomial-time algorithm.
result Establishes the unique and efficient identifiability of the hidden halfspace.
We present a simple, general technique for reducing the sample complexity of matrix and tensor decomposition algorithms applied to distributions. We use the technique to give a polynomial-time algorithm for standard ICA with sample complexity nearly linear in the dimension, thereby improving substantially on previous b…
Alexander polynomial degree correlates with knot defect, proving conjecture for defect zero.
problem Characterizing knot polynomials and their defects.
method Analyzing differential expansions and degree in of Alexander polynomials.
result Proved Alexander polynomial degree correlates with knot defect, especially for defect zero.
Chebyshev polynomials analyze Czech enterprises' stock dynamics.
problem Analyzing stock dynamics of enterprises not following normal distribution.
method Chebyshev polynomial decomposition of stock time series.
result Allows effective analysis of stock dynamics without variance and correlation.
Polynomial convergence proved for SGM, improving over previous methods.
problem Learning probability distributions from data and generating samples efficiently.
method Proved polynomial convergence for SGM using accurate score estimates.
result First polynomial convergence guarantees for SGM, independent of dimensionality.
Strongly polynomial algorithm for approximate Forster transforms and halfspace learning.
problem Computing approximate Forster transforms and halfspace learning.
method Strongly polynomial time algorithm for approximate Forster transforms and halfspace learning.
result First strongly polynomial time algorithm for distribution-free PAC learning of halfspaces.
Effect of detrending on multifractal characteristicsphysics.data-an
Different variants of MFDFA technique are applied in order to investigate various (artificial and real-world) time series. Our analysis shows that the calculated singularity spectra are very sensitive to the order of the detrending polynomial used within the MFDFA method. The relation between the width of the multifrac…
Develops polynomial diffusion models for multi-factor commodity futures dynamics.
problem Modeling futures prices using latent state variables for short and long-term stochastic factors.
method Polynomial diffusion models to incorporate non-linear effects, two filtering methods for estimation.
result Accurate estimation of futures prices despite parameter identification issues in polynomial diffusion models.
In the setting of polynomial jump-diffusion dynamics, we provide an explicit formula for computing correlators, namely, cross-moments of the process at different time points along its path. The formula appears as a linear combination of exponentials of the generator matrix, extending the well-known moment formula for p…
Polynomial-time algorithm learns causal graphs without parametric assumptions.
problem Learning causal graphs from data without assuming linearity or parametric forms.
method Model-free polynomial-time algorithm with finite-sample guarantees.
result Algorithm achieves linear cost in dimension and samples compared to optimal.
Polynomial distribution can be applied to dynamical systems in certain situations. Macroeconomic systems characterized by economic variables such as income and wealth can be modelled similarly using polynomials. We extend our previous work to data regarding income from a more diversified pool of countries, which contai…
From analysis of a big variety of different knots we conclude that at q which is an root of unity, q^{2m}=1, HOMFLY polynomials in symmetric representations [r] satisfy recursion identity: H_{r+m} = H_r H_m for any A, which is a generalization of the property H_r = (H_1)^r for special polynomials at q=1. We conjecture …
Paper proves first non-trivial PTF testing lower bounds for NGCA.
problem Proving lower bounds against PTF tests is challenging.
method Developed tools to prove PTF testing lower bounds for NGCA.
result First non-trivial PTF testing lower bounds for NGCA.
Develops AMITE for analyzing neural network nonlinearities.
problem Addressing difficulties in verification, explainability, and security in neural network analysis.
method Analytically modified integral transform expansion (AMITE) for neural network nonlinearities.
result First to provide six mutually exclusive desired expansion properties.
New bounds for learning polynomial surrogates with guarantees.
problem Learning polynomial surrogates for bounded binary functions with error guarantees.
method Characterized minimax sample complexity for two classes of polynomials under subgaussian noise.
result Sample complexity rates differ from noiseless case, scaling as for degree polynomials and for sparse polynomials.
Fine-grained analysis of gradient descent with momentum provides modified loss equations.
problem Understanding the dynamics of gradient descent with momentum.
method Fine-grained analysis and derivation of modified loss equations.
result Global approximation bounds and continuous modified equations for HB.
This work analyzes how different layers in deep neural networks contribute to generalization error.
problem Understanding the role of each layer in deep neural networks for generalization.
method Spectral analysis, Neural Tangent Kernel, Hermite polynomials, Spherical Harmonics.
result Initial layers in deep neural networks have a larger bias towards high-frequency functions.