Anastasis Kratsios

Orcid: 0000-0001-6791-3371

According to our database1, Anastasis Kratsios authored at least 33 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Low-dimensional approximations of the conditional law of Volterra processes: a non-positive curvature approach.
CoRR, 2024

Reality Only Happens Once: Single-Path Generalization Bounds for Transformers.
CoRR, 2024

Mixture of Experts Soften the Curse of Dimensionality in Operator Learning.
CoRR, 2024

Digital Computers Break the Curse of Dimensionality: Adaptive Bounds via Finite Geometry.
CoRR, 2024

Breaking the Curse of Dimensionality with Distributed Neural Computation.
CoRR, 2024

Characterizing Overfitting in Kernel Ridgeless Regression Through the Eigenspectrum.
CoRR, 2024

2023
Small Transformers Compute Universal Metric Embeddings.
J. Mach. Learn. Res., 2023

Deep Kalman Filters Can Filter.
CoRR, 2023

Neural Snowflakes: Universal Latent Graph Inference via Trainable Latent Geometries.
CoRR, 2023

Regret-Optimal Federated Transfer Learning for Kernel Regression with Applications in American Option Pricing.
CoRR, 2023

Capacity Bounds for Hyperbolic Neural Network Representations of Latent Tree Structures.
CoRR, 2023

A Transfer Principle: Universal Approximators Between Metric Spaces From Euclidean Universal Approximators.
CoRR, 2023

Generative Ornstein-Uhlenbeck Markets via Geometric Deep Learning.
CoRR, 2023

A Theoretical Analysis of the Test Error of Finite-Rank Kernel Ridge Regression.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022
Do ReLU Networks Have An Edge When Approximating Compactly-Supported Functions?
Trans. Mach. Learn. Res., 2022

Universal Approximation Theorems for Differentiable Geometric Deep Learning.
J. Mach. Learn. Res., 2022

Learning sub-patterns in piecewise continuous functions.
Neurocomputing, 2022

Instance-Dependent Generalization Bounds via Optimal Transport.
CoRR, 2022

Designing Universal Causal Deep Learning Models: The Case of Infinite-Dimensional Dynamical Systems from Stochastic Analysis.
CoRR, 2022

Piecewise-Linear Activations or Analytic Activation Functions: Which Produce More Expressive Neural Networks?
CoRR, 2022

Metric Hypertransformers are Universal Adapted Maps.
CoRR, 2022

Universal Approximation Under Constraints is Possible with Transformers.
Proceedings of the Tenth International Conference on Learning Representations, 2022

2021
NEU: A Meta-Algorithm for Universal UAP-Invariant Feature Representation.
J. Mach. Learn. Res., 2021

Universal Regular Conditional Distributions via Probability Measure-Valued Deep Neural Models.
CoRR, 2021

Quantitative Rates and Fundamental Obstructions to Non-Euclidean Universal Approximation with Deep Narrow Feed-Forward Networks.
CoRR, 2021

The Universal Approximation Property.
Ann. Math. Artif. Intell., 2021

Generative OrnsteinUhlenbeck Markets via Geometric Deep Learning.
Proceedings of the Geometric Science of Information - 6th International Conference, 2021

Optimizing Optimizers: Regret-optimal gradient descent algorithms.
Proceedings of the Conference on Learning Theory, 2021

2020
Overcoming The Limitations of Neural Networks in Composite-Pattern Learning with Architopes.
CoRR, 2020

Architopes: An Architecture Modification for Composite Pattern Learning, Increased Expressiveness, and Reduced Training Time.
CoRR, 2020

Non-Euclidean Universal Approximation.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019
Universal Approximation Theorems.
CoRR, 2019

2018
The NEU Meta-Algorithm for Geometric Learning with Applications in Finance.
CoRR, 2018


  Loading...