Smooth resolutions found for quotient of R^2 by infinite discrete groups.
problem Symplectic resolutions of quotient spaces by infinite discrete subgroups.
method Constructing smooth symplectic resolutions for R^2 under infinite discrete subgroups of GL_2(R).
result Minimal resolutions of Du Val singular varieties are symplectic resolutions of R^2/G.
Improves deep generative models to generate images of any size.
problem Fixed-sized output images from deep generative models.
method Integrates spatial noise vectors into fully convolutional neural networks.
result Theoretical interpretation of infinite spatial generation using spatial stochastic processes.
Infinite-dimensional SBDMs improve image generation across multiple resolutions.
problem Efficient image generation at high resolutions and across different levels.
method Developed SBDMs in infinite-dimensional setting, using trace class operators and operator networks.
result Improved efficiency and generalization across resolution levels.
The paper proves infinitely many free boundary minimal hypersurfaces in compact manifolds.
problem Existence of free boundary minimal hypersurfaces in compact Riemannian manifolds.
method Adaptations of A. Song's work and Marques-Neves' resolution to Yau's conjecture, combined with Li-Zhou's regularity theorem.
result Proves the existence of infinitely many almost properly embedded free boundary minimal hypersurfaces in compact manifolds.
Theory explains neural network scaling with dataset and model size.
problem Neural network scaling laws with dataset and model size.
method Identified variance-limited and resolution-limited scaling behaviors.
result Four scaling regimes explained: infinite data, infinite width, resolution-limited, and large width.
We present a construction of complete self-dual Einstein metrics of negative scalar curvature on an uncountable family of manifolds of infinite topological type, which are enumerated by continued fraction expansions of irrational numbers. These manifolds may be regarded as limits of the resolutions of cyclic quotient s…
Study complex structures of hyperkähler manifolds with infinite type.
problem Understanding complex structures of hyperkähler four-manifolds with infinite topological type.
method Analyzing the Gibbons-Hawking ansatz and proving biholomorphic relationships to hypersurfaces or minimal resolutions of singular surfaces.
result For almost all complex structures, the manifold is biholomorphic to a hypersurface in \(\mathbb{C}^3\). For the remaining, it is biholomorphic to the minimal resolution of a singular surface under certain conditions.
Most generative models for clustering implicitly assume that the number of data points in each cluster grows linearly with the total number of data points. Finite mixture models, Dirichlet process mixture models, and Pitman--Yor process mixture models make this assumption, as do all other infinitely exchangeable cluste…
The author has proved that a crepant resolution Y of a Ricci-flat Kähler cone X admits a complete Ricci-flat Kähler metric asymptotic to the cone metric in every Kähler class in H^2_c(Y,\R). These manifolds are generalizations of the Ricci-flat ALE Kähler spaces known by the work of P. Kronheimer, D. Joyce and others. …
The paper reformulates U-Nets as wavelet-based models and applies this to hierarchical VAEs.
problem Theoretical understanding and regularization properties of U-Nets and their relationship to wavelets.
method Formulating a multi-resolution framework to identify U-Nets as finite-dimensional truncations of infinite-dimensional models, proving average pooling corresponds to projection, and identifying HVAEs as discretizations of multi-resolution diffusion processes.
result HVAEs learn a time representation allowing for improved parameter efficiency through weight-sharing.
This paper tackles infinite-dimensional diffusion bridge simulation using operator learning.
problem Challenges in simulating diffusion bridges for modeling natural data due to intractable drift terms and continuous data representations.
method Merges score matching techniques with operator learning to directly learn infinite-dimensional bridges.
result Demonstrates high efficacy in simulating diffusion bridges for various applications, including real-world biological data.
In this paper we propose a generalization of deep neural networks called deep function machines (DFMs). DFMs act on vector spaces of arbitrary (possibly infinite) dimension and we show that a family of DFMs are invariant to the dimension of input data; that is, the parameterization of the model does not directly hinge …
NKN deep neural network learns governing equations and classifies images.
problem Learning governing equations and classifying images with deep neural networks.
method Nonlocal kernel network (NKN) that is resolution independent, deep, and handles various tasks.
result NKN outperforms baseline methods in learning governing equations and image classification tasks.
RI-DeepONet learns neural operators from arbitrary sensor data.
problem Discretization of input functions limits practical applications of DeepONet.
method Introduces RI-DeepONet and two dictionary learning algorithms for INRs.
result RINO handles arbitrary sensor data robustly and applies to various problems.
New method learns PDE solutions from low-fidelity data.
problem Challenges in learning PDE surrogates with scarce data.
method Flow matching in infinite-dimensional space with conditional neural operators.
result Accurately learns PDE solutions across different resolutions and fidelities.
New Stein fillings found for non-weighted homogeneous singularities.
problem Finding Stein fillings for certain non-weighted homogeneous singularities.
method Using spinal open books and nearly Lefschetz fibrations.
result Stein rational homology disk fillings for non-weighted homogeneous singularities.
The Lojasiewicz inequalities for real analytic functions on Euclidean space were first proved by Stanislaw Lojasiewicz (1965) using methods of semianalytic and subanalytic sets, arguments later simplified by Bierstone and Milman (1988). In this article, we first give an elementary geometric, coordinate-based proof of t…
FunDPS improves PDE solution recovery from sparse data.
problem Recovering whole solutions from sparse or noisy measurements in PDEs.
method Function-space diffusion model with gradient-based guidance.
result FunDPS achieves 32% accuracy improvement over state-of-the-art methods.
We use hyperbolic geometry to construct simply-connected symplectic or complex manifolds with trivial canonical bundle and with no compatible Kahler structure. We start with the desingularisations of the quadric cone in C^4: the smoothing is a natural S^3-bundle over H^3, its holomorphic geometry is determined by the h…
New knot homologies detect non-fibered knots, expanding on previous results.
problem Detecting non-fibered knots using knot homologies.
method Developed new knot homologies (knot Floer, Khovanov, HOMFLY) and proved a technical theorem.
result New homologies detect infinitely many non-fibered knots, expanding on previous results.
Combines techniques to remove tameness condition in Morse-Smale flows.
problem Tameness condition in Morse-Smale flows.
method Combines Shilnikov's ODE techniques with Latschev's ideas.
result Removes tameness hypothesis from homotopy formula.
SR-NAM maps low-res images to multiple high-res images realistically.
problem Mapping low-resolution images to multiple high-resolution images realistically.
method SR-NAM using Non-Adversarial Mapping (NAM) technique and a degradation model.
result Realistic degradation and down-sampling of high-resolution images.
Deep learning speeds up whole heart MRI to 30 seconds.
problem Long acquisition times in whole heart MRI.
method Deep learning, specifically a 3D residual U-Net, to reconstruct high-resolution images from low-resolution data.
result Super-resolution images show better edge sharpness and fewer artefacts than low-resolution images.
Paper confirms Thom's conjecture for nonlinear evolutions on manifolds.
problem Thom's gradient conjecture for nonlinear evolution equations.
method Extending and settling the conjecture in infinite dimensional problems using Łojasiewicz, L. Simon, and Kurdyka-Mostowski-Parusinski's foundational works.
result Uniqueness of the limiting direction and characterization of convergence rates for both classical and infinite dimensional settings.
The paper proposes a method to improve fine-resolution predictions using coarse-resolution data.
problem Limited supervision for fine-resolution predictions with scarce data.
method Attention-based regularization on multi-view coarse-resolution data.
result The method improves fine-resolution predictions using coarse-resolution data.
This study prioritizes temporal resolution over spatial in energy systems models due to higher influence.
problem The impact of spatial and temporal resolution on energy system models.
method Global sensitivity analysis to compare structural aspects, spatial, and temporal resolution.
result Temporal resolution has a higher influence on all results parameters compared to spatial resolution.
Deep learning improves 3D microscopy resolution without matched target images.
problem Anisotropic resolution in volumetric fluorescence microscopy.
method Cycle-consistent generative adversarial network trained on unpaired 2D images.
result Enhanced axial resolution and restored details between imaging planes.
New principle reveals how neural networks learn complex interactions.
problem Understanding neural networks' success and complexity.
method Infinite-width networks, focusing on frequency and space.
result Fine-grained eigenstructure improves network learnability.
There are 2^n possible resolutions of a smooth pseudodiagram with n precrossings. If we consider piecewise-linear (PL) pseudodiagrams and resolutions that themselves are PL, certain resolutions of the pseudodiagram may not exist in three-space. We investigate this situation and its impact on the weighted resolution set…
Optimal multiscale learning of linear operators
problem Statistical and computational limits of learning bounded linear operators between Sobolev spaces
method Reformulate as an infinite-dimensional matrix regression problem with heterogeneous multiscale structure
result Establish minimax rates and construct a finite-resolution blockwise least-squares estimator attaining these rates
Generalizes neural networks for infinite-dimensional mappings, including PDE solutions.
problem Learning mappings between infinite-dimensional spaces and finite-dimensional approximations.
method Graph kernel network architecture with message passing for kernel integration.
result Competitive performance compared to state-of-the-art solvers for PDEs.
Recently M. Kreck introduced a class of stratified spaces called p-stratifolds [M. Kreck, Stratifolds, Preprint]. He defined and investigated resolutions of p-stratifolds analogously to resolutions of algebraic varieties. In this note we study a very special case of resolutions, so called optimal resolutions, for p-str…
The paper presents a method to recover high-resolution signals from low-resolution measurements.
problem Recovering high-resolution signals from low-resolution indirect measurements.
method Combining generalized sampling and functional principal component analysis.
result High-resolution recovery is possible under certain conditions and with a sufficiently large training set.
A resolution of the St. Petersburg paradox is presented. In contrast to the standard resolution, utility is not required. Instead, the time-average performance of the lottery is computed. The final result can be phrased mathematically identically to Daniel Bernoulli's resolution, which uses logarithmic utility, but is …
The `Folk Theorem' that a smooth action by a compact Lie group can be (canonically) resolved, by iterated blow up, to have unique isotropy type is proved in the context of manifolds with corners. This procedure is shown to capture the simultaneous resolution of all isotropy types in a `resolution tower' which projects …
Study contact resolutions for Jacobi structures, providing examples and impossibility results.
problem Understanding contact resolutions of Jacobi structures.
method Examining various classes of Jacobi structures and their contact properties.
result Identified conditions under which contact resolutions exist and those where they do not.
Study on critical points in random neural networks, revealing three regimes based on activation function.
problem Investigating the expected number of critical points in random neural networks.
method Deriving asymptotic formulas for critical points under infinite-width limit and suitable regularity conditions.
result Three distinct regimes of critical points behavior depending on activation function.
Running high-resolution physical models is computationally expensive and essential for many disciplines. Agriculture, transportation, and energy are sectors that depend on high-resolution weather models, which typically consume many hours of large High Performance Computing (HPC) systems to deliver timely results. Many…
WrapNet optimizes inference for low-resolution neural networks by using 8-bit additions.
problem Reducing multiplication complexity in low-resolution neural networks.
method Adapting neural networks to use low-resolution (8-bit) additions in accumulators, with a cyclic activation layer and overflow penalty regularizer.
result Achieves comparable classification accuracy to 32-bit counterparts using low-resolution additions.
Novel neural operator predicts complex spatiotemporal dynamics from partial observations.
problem Capturing complex operator dynamics in infinite-dimensional function spaces.
method Integrates Koopman operator theory with deep neural networks to approximate nonlinear operators between Banach spaces.
result BNO achieves robust zero-shot super-resolution in unsteady flow prediction and outperforms conventional methods.
This paper simplifies diffusion models for high resolution images.
problem Applying diffusion models to high resolution images is challenging.
method Adjust noise schedule, scale specific parts, add dropout, and use downsampling.
result Achieved state-of-the-art image generation performance.
A refined form of the `Folk Theorem' that a smooth action by a compact Lie group can be (canonically) resolved, by iterated blow up, to have unique isotropy type was established by the authors in the context of manifolds with corners; the canonical construction induces fibrations on the boundary faces of the resolution…
Some Poisson structures do admit resolutions by symplectic manifolds of the same dimension. We give examples and simple conditions under which such resolutions can not exist.
The shortage of high-resolution urban digital elevation model (DEM) datasets has been a challenge for modelling urban flood and managing its risk. A solution is to develop effective approaches to reconstruct high-resolution DEMs from their low-resolution equivalents that are more widely available. However, the current …
New deep learning method improves 4D Flow MRI super-resolution under domain shift.
problem Domain shift in low-resolution 4D Flow MRI data.
method Distributional deep learning framework for domain generalization.
result Framework significantly outperforms traditional methods in real data applications.
Training a deep neural network for classification constitutes a major problem in remote sensing due to the lack of adequate field data. Acquiring high-resolution ground truth (GT) by human interpretation is both cost-ineffective and inconsistent. We propose, instead, to utilize high-resolution, hyperspectral images for…
Obtaining magnetic resonance images (MRI) with high resolution and generating quantitative image-based biomarkers for assessing tissue biochemistry is crucial in clinical and research applications. How- ever, acquiring quantitative biomarkers requires high signal-to-noise ratio (SNR), which is at odds with high-resolut…
Generates high-resolution images from low-resolution inputs.
problem Generating realistic images from low-resolution inputs.
method Latent Adversarial Generator (LAG) using perceptual loss.
result Samples of high-resolution images from low-resolution inputs.