Graph Neural Networks improve financial time series forecasting accuracy.
problem Forecasting univariate financial time series with statistical significance.
method Introducing the Time-Geometric model combining geometric and temporal patterns.
result Statistically significant improvements in forecasting accuracy through geometric patterns.
Geometric framework links clustering accuracy to structural recovery.
problem Understanding the trade-off between robustness and sensitivity in clustering.
method Develops a clustering condition number to compare within-cluster scale to the minimum loss increase required to move a point across a cluster boundary.
result Sharp phase transitions for exact recovery under different objectives, providing geometric principle for interpreting low objective values.
The loss functions of deep neural networks are complex and their geometric properties are not well understood. We show that the optima of these complex loss functions are in fact connected by simple curves over which training and test accuracy are nearly constant. We introduce a training procedure to discover these hig…
GDB bridges geometric states with improved accuracy and generality.
problem Challenges in predicting geometric state evolution in complex systems.
method Geometric Diffusion Bridge (GDB) framework using equivariant diffusion bridges.
result GDB surpasses existing methods in accurately bridging geometric states.
Enhanced spectral clustering for geometric graphs improves clustering accuracy.
problem Ineffective standard spectral clustering for geometric graphs.
method Higher-order spectral clustering using higher-order eigenvectors.
result Established weak and strong consistency for Soft Geometric Block Model.
A fast geometric regularizer improves event camera performance.
problem Event collapse in contrast maximization framework.
method Geometric regularizer to mitigate overfitting.
result State-of-the-art accuracy with reduced computational complexity.
Deep learning transforms data geometrically, akin to Ricci flow, improving classification accuracy.
problem Understanding geometric transformations in non-smooth activation functions.
method Developed a computational framework to quantify geometric changes in DNNs and introduced the concept of `global Ricci network flow`.
result Global Ricci network flow correlates with DNN accuracy, independent of network architecture and data set.
GETF efficiently decomposes large-scale Boolean tensors.
problem Efficiently factorizing large-scale Boolean tensors.
method Geometric Expansion for all-order Tensor Factorization (GETF).
result GETF significantly improves reconstruction accuracy and efficiency.
Proposes IIKL for preserving geometric properties of non-Euclidean data.
problem Loss of geometric information in non-Euclidean data representation.
method IIKL method builds Riemannian manifold and isometrically induces metric.
result Preserves geometric structure of original data in 3D and high-dimensional datasets.
New method makes robust estimators work without knowing corruption levels.
problem Robust estimation algorithms struggle with unknown corruption levels.
method Abstracted geometric puzzle solution to universal meta technique.
result Converts any robust estimator to work without corruption bounds.
New methods improve accuracy in detecting concentric objects.
problem Detecting concentric geometric objects in noisy data.
method Developed new estimators and compared performance of existing methods.
result New methods outperform existing non-iterative methods and are robust to noise.
New method uses geometric moments for accurate machine learning potentials.
problem Creating high-dimensional potential energy surfaces efficiently.
method Feed-forward neural networks with invariant local molecular descriptors based on geometric moments.
result Accuracy comparable to established models, high efficiency.
Wi-GATr learns to simulate wireless signals with high accuracy and speed.
problem Inaccurate wireless signal propagation models limit modern communication system design.
method Wi-GATr uses a Geometric Algebra Transformer to learn from scene primitives.
result Wi-GATr achieves more accurate predictions than existing methods.
A lightweight framework improves convergence and stability of PINNs for complex PDEs.
problem Training instability and reduced accuracy in PINNs for complex PDEs.
method Adaptive curvature correction using secant information to optimize first-order optimizers.
result Consistent improvements in convergence speed, stability, and accuracy over standard optimizers.
The long-term dependence of Bitcoin (BTC), manifesting itself through a Hurst exponent H>0.5, is exploited in order to predict future BTC/USD price. A Monte Carlo simulation with 104 geometric fractional Brownian motion realisations is performed as extensions of historical data. The accuracy of statistical inferen…
Graphs from features improve classification accuracy in tasks.
problem Traditional classification tasks can be improved by incorporating relational information.
method Construct geometric graphs from features and use them in Graph Convolutional Networks.
result Graphs derived from features increase classification accuracy and improve class separation.
We propose a geometric algorithm for topic learning and inference that is built on the convex geometry of topics arising from the Latent Dirichlet Allocation (LDA) model and its nonparametric extensions. To this end we study the optimization of a geometric loss function, which is a surrogate to the LDA's likelihood. Ou…
DM approximates submanifolds with error bounds.
problem Understanding the accuracy of Diffusion Maps in embedding submanifolds.
method Deriving geometric properties and deriving bounds on embedding errors.
result Error bounds for DM embeddings and tangent spaces.
The method of geometric harmonics is adapted to the situation of incomplete data by means of the iterated geometric harmonics (IGH) scheme. The method is tested on natural and synthetic data sets with 50--500 data points and dimensionality of 400--10,000. Experiments suggest that the algorithm converges to a near optim…
We study polygonal analogues of several moving boundary problems and their time discretization which preserves the constant area speed property. We establish various polygonal analogues of geometric formulas for moving boundaries and make use of the geometric formulas for our numerical scheme and its analysis of genera…
Study shows latent space OOD detection isn't a reliable proxy for model performance.
problem Evaluating and interpreting deep learning systems on real-world data.
method Empirical investigation of latent space OOD detection and classification accuracy using SAR datasets.
result OOD detection cannot be used as a proxy measure for model performance.
A new method for group invariant machine learning using geometric projections.
problem Supervised group invariant and equivariant machine learning.
method Geometric topology approach involving projection of input data into a geometric space parametrizing symmetry group orbits.
result Improvement in accuracy compared to existing methods.
We revisit the task of learning a Euclidean metric from data. We approach this problem from first principles and formulate it as a surprisingly simple optimization problem. Indeed, our formulation even admits a closed form solution. This solution possesses several very attractive properties: (i) an innate geometric app…
Bayesian design improves accuracy without extra cost.
problem Nested inference in complex systems limits BED accuracy and efficiency.
method Grouped geometric pooled posterior with EKI formulation.
result Improved accuracy and stable estimators at comparable cost.
Optimal fees for G3Ms align LP value with market accuracy.
problem Optimal fees for G3Ms to attract liquidity without sacrificing accuracy.
method Developed a framework for determining LP value with fees for G3Ms under diffusion.
result LPs prefer G3Ms over other strategies as fees approach zero.
Entropy corrections improve GBM's predictive accuracy for non-log-normal distributions.
problem Log-normal distribution limitations in GBM predictions.
method Entropy corrections to geometric Brownian motion (GBM).
result Improved predictive accuracy for non-log-normal distributions.
Unified geometric flows improve deep learning efficiency and simplify neural network topologies.
problem Improving deep learning performance and simplifying neural network structures.
method Proposes a thermodynamically coupled Ricci flow that dynamically adapts parameter space geometry to loss landscape topology, enabling automated singularity resolution and providing entanglement entropy bounds.
result Demonstrates 2.1× convergence acceleration and 63% topological simplification while maintaining O(NlogN) complexity, outperforming Riemannian baselines by 15.2% in few-shot accuracy. New method calculates geometric Brownian motion with affine drift and its integral.
problem Calculating the distribution of geometric Brownian motion with affine drift and its integral.
method Laplace transform approach and Heun differential equation.
result Joint distribution of geometric Brownian motion with affine drift and its integral can be determined.
Several data analysis techniques employ similarity relationships between data points to uncover the intrinsic dimension and geometric structure of the underlying data-generating mechanism. In this paper we work under the model assumption that the data is made of random perturbations of feature vectors lying on a low-di…
Geometric approach improves motion alignment accuracy and efficiency.
problem Temporal alignment of human motion data for various applications.
method Geometric point of view, principal fiber bundle, reparameterization invariant projection, dynamic programming, keyframe correspondences.
result Temporal alignment procedures are more accurate and computationally efficient.
Foundation models fail to preserve continuous geometry, identified as the Geometric Alignment Tax.
problem Continuous geometry is lost in foundation models due to discrete categorical bottlenecks.
method Controlled ablations on synthetic systems and evaluation of 14 biological models using rate-distortion theory and MINE.
result Replacing cross-entropy with a continuous head reduces geometric distortion by up to 8.5x.
Geometric stability predicts steerability and detects drift in language models.
problem Predicting steerability and detecting drift in language models.
method Supervised and unsupervised geometric stability measures.
result Supervised geometric stability predicts steerability with high accuracy and detects drift earlier.
Geometric observables detect financial regime shifts with high accuracy.
problem Detecting regime shifts in financial markets.
method Extracted four geometric observables from equity-index returns and evaluated them against various baseline methods.
result The Berry Phase Rate achieves an unbiased out-of-sample median Cohen's d of 0.72, significantly reducing false alarms.
JORC-UMAP improves UMAP by incorporating geometric and topological priors.
problem UMAP's local Euclidean distance assumption fails to capture intrinsic manifold geometry, leading to topological tearing and structural collapse.
method JORC-UMAP introduces Ollivier-Ricci curvature as a geometric prior and Jaccard similarity as a topological prior to reinforce edges and reduce redundant links.
result JORC-UMAP reduces tearing and collapse more effectively than standard UMAP and other DR methods, as measured by SVM accuracy and triplet preservation scores.
We examine a class of embeddings based on structured random matrices with orthogonal rows which can be applied in many machine learning applications including dimensionality reduction and kernel approximation. For both the Johnson-Lindenstrauss transform and the angular kernel, we show that we can select matrices yield…
There are many methods developed to approximate a cloud of vectors embedded in high-dimensional space by simpler objects: starting from principal points and linear manifolds to self-organizing maps, neural gas, elastic maps, various types of principal curves and principal trees, and so on. For each type of approximator…
Improved Kriging model reduces prediction errors.
problem Improving prediction accuracy in Kriging models.
method Theta-regularized Kriging model with Lasso, Ridge, and Elastic-net penalties.
result The Theta-regularized Kriging model outperforms other penalized Kriging models in accuracy and stability.
GeoHNN models physics laws for stable, accurate predictions.
problem Violations of physical principles in machine learning models.
method Explicitly encodes geometric priors in inertia and phase space.
result Significantly outperforms existing models in long-term stability and accuracy.
New approach interprets Nyström for kernel machines with geometric insight.
problem No comparative study over Nyström-based kernel machine approaches.
method Developed a new approach with geometric interpretation, showing equivalence to existing methods.
result Proposed approach offers insights into approximation errors and accuracy.
Co-PLNet combines point and line predictions to improve wireframe parsing accuracy and efficiency.
problem Separate line and point predictions lead to inconsistent wireframes.
method Co-PLNet uses a Point-Line Prompt Encoder to convert early point detections into spatial prompts, which guide line refinement.
result Co-PLNet achieves better accuracy and robustness in wireframe parsing compared to existing methods.
Geometric methods integrate Lie systems for optimal control problems.
problem Integrating Lie systems for optimal control problems.
method Geometric numerical methods based on Magnus expansions and Runge-Kutta-Munthe-Kaas.
result Accurate numerical solutions for Lie systems in optimal control problems.
The paper proposes methods for volumetric parameterization of 3D solid manifolds.
problem Complex structure of solid manifolds makes conventional approaches ineffective.
method Incorporates models to preserve geometric structure, achieve density equalization, and balance distortions.
result Various 3D manifold parameterizations with different properties can be achieved.
Geometric approach improves probabilistic robustness in neural networks.
problem Widespread lack of robustness in deep neural networks to adversarial examples.
method Geometric view on Probabilistically Robust Learning (PRL) and introduction of new perimeters.
result Existence of solutions and properties of modified PRL models.
Decision trees and shallow neural networks have different geometric complexities, impacting their interpretability and accuracy.
problem The geometric simplicity of decision boundaries in decision trees conflicts with the approximation capabilities of shallow neural networks.
method Analysis of the Radon total variation (RTV) seminorm to compare geometric complexity of decision regions and neural network approximations.
result Smooth barrier scores can approximate decision regions with finite RTV, but their performance depends on the tube-mass condition near the decision boundary.
Study finds GBM model accurately predicts stock prices on Ghana Stock Exchange.
problem Investigating the suitability of GBM for modeling stock price dynamics.
method Geometric Brownian Motion model applied to weekly and monthly returns of equities listed on the Ghana Stock Exchange.
result GBM model accurately forecasts stock prices with minimal deviations, as evidenced by MSE evaluations.
Study shows how steepest descent algorithms' geometric margin increases during training.
problem Understanding implicit bias in steepest descent algorithms for neural networks.
method Analysis of steepest descent algorithms with infinitesimal learning rates in homogeneous neural networks.
result Limit points of training trajectories correspond to KKT points of margin-maximization problems.
GeoTop resolves topological ambiguity in diagnostic imaging using geometric-topological analysis.
problem Topological equivalence between benign and malignant structures in diagnostic images.
method Combines Topological Data Analysis and Lipschitz-Killing Curvatures to resolve ambiguity.
result Achieves 3.6% accuracy improvement and reduces false positives/negatives by 15-18%.
We present a coupled Variational Auto-Encoder (VAE) method that improves the accuracy and robustness of the probabilistic inferences on represented data. The new method models the dependency between input feature vectors (images) and weighs the outliers with a higher penalty by generalizing the original loss function t…