New approach to convex hulls for low-rank problems.
problem Characterizing convex hulls for low-rank sets.
method Matrix perspective function and orthogonal projection matrices.
result Strong relaxations for various low-rank problems.
This paper studies continuum-armed bandits under Besov smoothness conditions and derives minimax rates.
problem Optimizing an unknown function with limited evaluations.
method Studies continuum-armed bandits under Besov smoothness conditions and derives minimax rates.
result Minimax rates over Besov spaces are identical to those over the smallest Hölder space into which Besov spaces embed.
We propose a new perspective on representation learning in reinforcement learning based on geometric properties of the space of value functions. We leverage this perspective to provide formal evidence regarding the usefulness of value functions as auxiliary tasks. Our formulation considers adapting the representation t…
New method encodes function preferences into neural nets for better generalization.
problem Challenges in encoding explicit function preferences in neural network training.
method Function-space empirical Bayes (FSEB) regularization.
result FSEB leads to near-perfect semantic shift detection and improved generalization.
Kernel methods are among the most popular techniques in machine learning. From a frequentist/discriminative perspective they play a central role in regularization theory as they provide a natural choice for the hypotheses space and the regularization functional through the notion of reproducing kernel Hilbert spaces. F…
New definition of stable (r+1)-th capillary hypersurfaces proposed.
problem Stability of capillary hypersurfaces in different geometries.
method Defining stable (r+1)-th capillary hypersurfaces as smooth local minimizers of a new energy functional under volume-preserving and contact angle-preserving variations. result Generalization of stability results to (r+1)-th capillary hypersurfaces. Unified theory of deep neural networks with diverse activations.
problem Understanding the relationship between depth and complexity in deep neural networks.
method Developed a unified function space theory for deep networks with various activations.
result Unified theory provides meaningful complexity for deep networks with diverse activations.
Machine learning models predict which ideas will be innovated based on subjective perspectives.
problem Predicting high-impact innovation based on subjective perspectives and interpersonal innovation opportunities.
method Quantifying subjective perspectives and their interaction based on innovator positions within a geometric space of concepts.
result Subjective perspectives predict which ideas individuals and groups will creatively attend to and successfully combine in the future.
We take a Hamiltonian-based perspective to generalize Nesterov's accelerated gradient descent and Polyak's heavy ball method to a broad class of momentum methods in the setting of (possibly) constrained minimization in Euclidean and non-Euclidean normed vector spaces. Our perspective leads to a generic and unifying non…
Although operator-valued kernels have recently received increasing interest in various machine learning and functional data analysis problems such as multi-task learning or functional regression, little attention has been paid to the understanding of their associated feature spaces. In this paper, we explore the potent…
Smooth metric measure spaces have been studied from the two different perspectives of Bakry-Émery and Chang-Gursky-Yang, both of which are closely related to work of Perelman on the Ricci flow. These perspectives include a generalization of the Ricci curvature and the associated quasi-Einstein metrics, which include Ei…
Kernel-based Bayesian filter for nonlinear systems using infinite-dimensional operators.
problem Modeling and predicting nonlinear dynamical systems.
method Functional Bayesian perspective, reproducing kernel Hilbert space, Gaussian kernel.
result Effective approximation and accurate results for nonlinear systems.
Develops theory for conditional optimal transport in infinite-dimensional spaces.
problem Bayesian inference with functional parameters in infinite-dimensional spaces.
method Theory of constrained optimal transport for block-triangular maps.
result Regularity estimates on conditioning maps from prior to posterior.
Closed strings can be seen either as one-dimensional objects in a target space or as points in the free loop space. Correspondingly, a B-field can be seen either as a connection on a gerbe over the target space, or as a connection on a line bundle over the loop space. Transgression establishes an equivalence between th…
We use a Lagrangian perspective to show the limiting absorption principle on Riemannian scattering, i.e. asymptotically conic, spaces, and their generalizations. More precisely we show that, for non-zero spectral parameter, the `on spectrum', as well as the `off-spectrum', spectral family is Fredholm in function spaces…
New differential geometry perspective on orthogonal RNNs.
problem Mitigating exploding and vanishing gradients in RNNs.
method Using tools from differential geometry, parameterizing vector fields via directional derivatives of scalar functions.
result Our approach achieves comparable or better results on benchmark tasks.
Residual Networks (ResNets) have become state-of-the-art models in deep learning and several theoretical studies have been devoted to understanding why ResNet works so well. One attractive viewpoint on ResNet is that it is optimizing the risk in a functional space by combining an ensemble of effective features. In this…
Gaussian processes help in modeling complex, nonlinear relationships in signal processing.
problem Modeling complex, nonlinear relationships in signal processing.
method Sequential inference for Gaussian processes.
result Gaussian processes enable efficient and accurate modeling of complex relationships.
Examines challenges and proposes new approaches in machine learning theory.
problem Challenges in machine learning as a function approximation and optimization.
method Mathematical analysis of gradient descent, fixed network limitations, and RNNs.
result New insights and mathematical approaches to improve machine learning.
Geometric approach improves functional outlier detection.
problem Detecting outliers in functional data sets.
method Developed a geometric perspective on functional manifold for outlier detection.
result Improved understanding and differentiation of outliers.
Study inextensible flows of curves in 4D pseudo-Galilean space and defines energy functions.
problem Analyzing inextensible flows and energy of curves in 4D pseudo-Galilean space.
method Expressed inextensible flows as partial differential equations, defined directional derivatives, and expressed bending elastic energy functions.
result Necessary and sufficient conditions for inextensible flows are given as partial differential equations.
VAEs analyzed using harmonic analysis, showing how variance controls frequency content and robustness.
problem Understanding and optimizing VAEs for robustness and frequency control.
method Viewing VAE latent space as Gaussian space, deriving results on variance and frequency content, and demonstrating soft Lipschitz constraints.
result Increasing encoder variance reduces high frequency content and improves adversarial robustness.
We study the L2 gradient flow of the Yang--Mills functional on the space of connection 1-forms on a principal G-bundle over the sphere S2 from the perspective of Morse theory. The resulting Morse homology is compared to the heat flow homology of the space ΩG of based loops in the compact Lie group G. An iso…
Machine learning techniques are being increasingly used as flexible non-linear fitting and prediction tools in the physical sciences. Fitting functions that exhibit multiple solutions as local minima can be analysed in terms of the corresponding machine learning landscape. Methods to explore and visualise molecular pot…
Unified theory for representation learning using learnable functions.
problem Insufficient theoretical understanding of unsupervised and self-supervised learning.
method Discriminative theoretical framework for analyzing sample complexity.
result Learnable regularization functions can reduce the amount of labeled data needed.
Survey explores translation surfaces from geometric and topological perspectives.
problem Underutilized aspects of translation surfaces in dynamical viewpoint.
method Equivalent definitions, moduli spaces, period map, holonomy map.
result Highlights foundational, yet underrated, aspects of translation surfaces theory.
The paper tackles noisy functional data by exploring a multivariate perspective.
problem Noisy functional data measured on discrete points.
method Factor model and principal components analysis.
result The latent signal can be accurately estimated using multivariate methods.
We establish geometric and topological properties of the space of value functions in finite state-action Markov decision processes. Our main contribution is the characterization of the nature of its shape: a general polytope (Aigner et al., 2010). To demonstrate this result, we exhibit several properties of the structu…
Paper develops compact formulations for optimization problems with rank-one convex functions and indicator variables.
problem Optimization problems involving rank-one convex functions with support constraints.
method Perspective reformulation techniques to exploit conic structure and establish convex hull results.
result Systematic perspective formulations for convex hull descriptions of sets with nonlinear separable or non-separable objective functions and combinatorial constraints.
Unified cosmological and Einstein polytope theories.
problem Unified understanding of cosmological and Einstein polytope theories.
method Unified combinatorial perspective of cosmological and Einstein polytope theories.
result Unified construction of cosmological and Einstein polytope theories.
We establish general versions of a variety of results for quasiconvex, lower-semicontinuous, and law-invariant functionals. Our results extend well-known results from the literature to a large class of spaces of random variables. We sometimes obtain sharper versions, even for the well-studied case of bounded random var…
This paper provides a unifying view of a wide range of problems of interest in machine learning by framing them as the minimization of functionals defined on the space of probability measures. In particular, we show that generative adversarial networks, variational inference, and actor-critic methods in reinforcement l…
This paper develops a pricing model for data assets from the buyer's perspective.
problem Insufficient research on pricing data assets from the buyer's perspective.
method Develops a pricing model based on the informational value of data assets from the buyer's perspective, using an implicit function derived from value functions in investment-consumption problems under ambiguity markets.
result Derives general expressions and explicit pricing formulas for data assets under various conditions.
Novel framework proves fast RL convergence in continuous spaces.
problem Analyzing stability in continuous state-action RL.
method Introduces a novel framework to analyze stability properties of RL.
result Highlights two key stability properties and demonstrates their satisfaction in RL.
Gradient descent reshapes the function space of neural networks.
problem Understanding how feature learning affects the function space of neural networks.
method Characterized the evolution of the feature space during training using a two-layer neural network.
result Gradient descent induces a data-adaptive deformation that selectively enhances signal-aligned directions.
Survey on moduli spaces of differentials from algebraic geometry perspective.
problem Understanding the topology of moduli spaces of differentials remains limited.
method Algebraic geometry perspective, connections to various fields.
result Many open problems and connections to other fields.
Unified perspective on Hopfield networks with attention module.
problem Understanding and optimizing Hopfield networks with attention mechanisms.
method Study of BM counterparts of modern Hopfield networks and their salient properties.
result Introduction of AttnBM with tractable likelihood and gradient.
Review of Gerber-Shiu function for practical actuarial science.
problem Difficulty in numerical approximation and statistical inference of Gerber-Shiu function.
method Comprehensive review of formulations, surplus processes, numerical methods, and statistical inference.
result Enhanced understanding and practical guide for Gerber-Shiu function.
New neural network models learn symmetric functions of varying input sizes.
problem Learning symmetric functions with varying input sizes.
method Functional perspective on neural networks, treating symmetric functions as functions over probability measures.
result Established approximation and generalization bounds for shallow architectures that extend across input sizes.
The paper studies deep neural networks with Gaussian weights and finds their asymptotic behavior.
problem Understanding the behavior of deep neural networks with large width.
method Function-space perspective, Gaussian process analysis, weak convergence in large-width limit.
result Deep neural networks with large width converge to a continuous Gaussian process.
The study examines how bias affects hypothesis formation in neural networks.
problem Characterizing the impact of bias on hypothesis formation in neural networks.
method An automated data-driven projection pursuit neural network to extract and select features for binary classification.
result The refinement of a working hypothesis converges to a robust multivariate perception of data.
Representation costs in data science: Unifying function-space views of parametric methods
problem Analyzing representation costs of parametric data-fitting methods
method Developing a general framework for analyzing representation costs through parameter-space regularizers
result Proving that many natural results hold in this abstract setting, including representer theorems for parametric methods on their native spaces
Vector-valued learning, where the output space admits a vector-valued structure, is an important problem that covers a broad family of important domains, e.g. multi-task learning and transfer learning. Using local Rademacher complexity and unlabeled data, we derive novel semi-supervised excess risk bounds for general v…
In this paper, we prove that a shallow neural network with a monotone sigmoid, ReLU, ELU, Softplus, or LeakyReLU activation function can arbitrarily well approximate any L^p(p>=2) integrable functions defined on R*[0,1]^n. We also prove that a shallow neural network with a sigmoid, ReLU, ELU, Softplus, or LeakyReLU act…
Lectures on deep learning from a learning theory perspective.
problem Understanding how deep learning architectures lead to inductive bias.
method Statistical learning theory and stochastic optimization.
result Gradient descent on linear diagonal networks can lead to various forms of implicit bias.
Unified view of GP approximations improves efficiency.
problem Disparate variational features limit GP efficiency.
method View GP as a Banach space to unify feature selection.
result Unified understanding of existing and new features.
New Morse functions on curve moduli space via geodesics.
problem Understanding the moduli space of curves via geometric and combinatorial methods.
method Introducing Morse functions based on geodesic lengths and analyzing their critical points and indices.
result Found new explicit Morse functions on Mg,n, leading to a combinatorial cell decomposition. A theory of sufficient dimension reduction (SDR) is developed from an optimizational perspective. In our formulation of the problem, instead of dealing with raw data, we assume that our ground truth includes a mapping f:Rn→Rm and a probability distribution function p over…