Study connects Gaussian processes and regularization for sequence-function mappings.
problem Understanding and interpreting sequence-function maps in biology.
method Relates Gaussian process priors, regularization, and gauge fixing in overparameterized weight space.
result Established the relationship between regularized regression and Gaussian processes in function space.
A fundamental aspect of biological information processing is the ubiquity of sequence-function relationships -- functions that map the sequence of DNA, RNA, or protein to a biochemically relevant activity. Most sequence-function relationships in biology are quantitative, but only recently have experimental techniques f…
Despite the widespread adoption of Transformer models for NLP tasks, the expressive power of these models is not well-understood. In this paper, we establish that Transformer models are universal approximators of continuous permutation equivariant sequence-to-sequence functions with compact support, which is quite surp…
New analysis shows RPE-based Transformers can't approximate all functions.
problem Understanding the limitations of RPE-based Transformers in approximating continuous functions.
method Mathematical analysis and development of a novel attention module (URPE) to overcome limitations.
result RPE-based Transformers can't approximate all continuous sequence-to-sequence functions, even with depth and width.
Transformers handle infinite dimensional inputs effectively by feature extraction and dynamic feature selection.
problem Understanding the approximation and estimation ability of Transformers with infinite dimensional inputs.
method Anisotropic smoothness analysis and feature extraction properties of Transformers.
result Transformers avoid the curse of dimensionality and dynamically select important features.
Sparse Transformers can approximate dense Transformers with only O(n) connections.
problem Can sparse Transformers approximate arbitrary sequence-to-sequence functions?
method Proposed sufficient conditions for universal approximation and proved that sparse Transformers with O(n) connections can approximate dense models.
result Sparse Transformers with O(n) connections can approximate the same function class as dense models with n^2 connections.
We consider a simple and overarching representation for permutation-invariant functions of sequences (or multiset functions). Our approach, which we call Janossy pooling, expresses a permutation-invariant function as the average of a permutation-sensitive function applied to all reorderings of the input sequence. This …
Genomic models learn DNA sequences to predict functions.
problem Understanding complex genetic interactions.
method Training LLMs on DNA sequences to predict functions.
result gLMs can predict functions of DNA elements.
Sumformer simplifies Transformers to handle long sequences efficiently.
problem Quadratic complexity of Transformers limits their use with long sequences.
method Introducing Sumformer, a simple architecture that universally approximates equivariant sequence-to-sequence functions.
result Sumformer achieves the first universal approximation results for Linformer and Performer.
Softmax attention approximates complex functions and subsumes many known universal approximators.
problem Universal approximation of continuous sequence-to-sequence functions.
method Interpolation-based analysis of attention's internal mechanism, showing its ability to approximate ReLU functions.
result Softmax attention is a universal approximator for continuous sequence-to-sequence functions.
We present a solution to scale spectral algorithms for learning sequence functions. We are interested in the case where these functions are sparse (that is, for most sequences they return 0). Spectral algorithms reduce the learning problem to the task of computing an SVD decomposition over a special type of matrix call…
Motivation: Modelling methods that find structure in data are necessary with the current large volumes of genomic data, and there have been various efforts to find subsets of genes exhibiting consistent patterns over subsets of treatments. These biclustering techniques have focused on one data source, often gene expres…
A new framework uses text descriptions to improve protein design.
problem Lack of effective methods to incorporate textual descriptions in protein design.
method ProteinDT framework that combines text and protein structural information.
result ProteinDT significantly improves protein design accuracy and performance.
BigBird improves transformer performance on NLP tasks with longer sequences.
problem Quadratic dependency on sequence length in transformer models.
method Sparse attention mechanism reducing quadratic dependency to linear.
result Significant improvement in performance on NLP tasks like QA and summarization.
BoGA combines evolutionary search with Bayesian optimization for efficient protein design.
problem Designing novel proteins with specific characteristics is challenging due to sequence space complexity.
method BoGA integrates a genetic algorithm with Bayesian optimization to efficiently explore sequence space.
result BoGA accelerates discovery of high-confidence binders for diverse protein design objectives.
Single-head transformers with a single self-attention layer can approximate any sequence-to-sequence function and are efficient under certain conditions.
problem Statistical and computational limits of prompt tuning for transformer-based models.
method Investigation of single-head transformers with a single self-attention layer, proving universality and efficiency under SETH.
result Existence of almost-linear time prompt tuning inference algorithms under certain conditions.
This work investigates how multi-round reasoning improves LLM performance.
problem Improving problem-solving abilities in complex tasks with LLMs.
method Investigates approximation, learnability, and generalization properties of multi-round auto-regressive models.
result Transformers with finite context windows are universal approximators for Turing-computable functions and can approximate any Turing-computable sequence-to-sequence function through multi-round reasoning.
The article explores the mapping class group using unicellular maps and provides filtrations.
problem Understanding the structure of the mapping class group.
method Using unicellular maps and surgeries, the article describes the mapping class group.
result Provides filtrations of the mapping class group.
Constructs a moment map flow for isotropic maps on surfaces.
problem Understanding isotropic maps on surfaces and their properties.
method Develops a Kähler moment map geometry and a modified moment map flow.
result Polyhedral modified moment map flow induces a strong deformation retraction.
Maps are an important medium that enable people to comprehensively understand the configuration of cultural activities and natural elements over different times and places. Although massive maps are available in the digital era, how to effectively and accurately access the required map remains a challenge today. Previo…
The paper constructs biharmonic maps between spheres using polynomial maps.
problem Creating biharmonic maps between spheres.
method Using harmonic homogeneous polynomial maps of different degrees to generate proper biharmonic maps.
result Established a method for constructing proper biharmonic product maps.
Both bi-harmonic map and f-harmonic map have nice physical motivation and applications. In this paper, by combination of these two harmonic maps, we introduce and study f-bi-harmonic maps as the critical points of the f-bi-energy functional 21∫Mf∣τ(φ)∣2dvg. This class of maps generalizes both …
Research explores real algebraic realization of round fold maps of codimension -1.
problem Real algebraic realization of round fold maps of codimension -1.
method Generalizes canonical projections of unit spheres to round fold maps and discusses their real algebraic realization.
result Developed new studies in real algebraic geometry focusing on round fold maps of codimension -1.
The paper derives Liouville theorems for various generalized maps on Riemannian manifolds.
problem Deriving Liouville theorems for generalized maps on Riemannian manifolds.
method Using conservation laws and monotonicity formulas, the paper derives Liouville theorems for different types of maps under various conditions.
result The paper establishes Liouville theorems for several types of generalized maps, including φ-F harmonic maps, φ-F symphonic maps, and φ-F-V-harmonic maps. This paper shows semi-equivelar toroidal maps are vertex-transitive covers.
problem Understanding the relationship between semi-equivelar and vertex-transitive toroidal maps.
method Proving semi-equivelar toroidal maps are quotients of vertex-transitive toroidal maps.
result Each semi-equivelar toroidal map has a finite vertex-transitive cover.
Paper defines and studies Clairaut warped product Riemannian maps.
problem Understanding the geometry of specific Riemannian maps.
method Identify geodesic conditions, derive conditions for Clairaut maps, and calculate curvature.
result Found conditions for a warped product Riemannian map to be Clairaut.
The paper explores unique continuation properties for polyharmonic maps between Riemannian manifolds.
problem Investigating unique continuation principles for polyharmonic maps.
method Analyzing critical points of higher order functionals to prove extensions of known results in harmonic and biharmonic cases.
result Proving extensions of unique continuation principles for k-harmonic maps.
The hyperelliptic mapping class group has been studied in various contexts within topology and algebraic geometry. What makes this study tractable is that there is a surjective map from the hyperelliptic mapping class group to a mapping class group of a punctured sphere. The more general family of superelliptic mapping…
This paper constructs real algebraic maps that are topologically special generic maps.
problem Constructing smooth maps in differential topology and real algebraic geometry.
method Constructs real algebraic maps that are topologically special generic maps.
result Real algebraic maps are topologically special generic maps.
A Reeb space is defined as the space of all the connected components of inverse images of a smooth map, which is a fundamental tool in studying smooth manifolds using generic smooth maps whose codimensions are not positive such as Morse functions, their higher dimensional versions including fold maps and general stable…
The paper constructs gluing maps for harmonic maps between Riemannian manifolds.
problem Constructing harmonic maps between Riemannian manifolds.
method Gluing construction of extended harmonic maps.
result Construction of gluing maps for harmonic maps under specific conditions.
Characterizes a general range decreasing group homomorphism.
problem Understanding range decreasing group homomorphisms in the entire mapping group.
method Characterization of a general range decreasing group homomorphism.
result Computes a particular class of homomorphisms and identifies all range decreasing group homomorphisms on specific mapping groups.
The paper examines HM-tensional and HS-tensional maps between Riemannian manifolds.
problem Analyzing tension fields of maps between Riemannian manifolds.
method Investigating harmonic maps and harmonic sections as tension fields.
result Characterization and properties of HM-tensional and HS-tensional maps. The paper proves a Liouville theorem for specific harmonic maps with free boundary.
problem Analyzing harmonic maps with free boundary conditions.
method Developed Liouville theorem for φ-F-symphonic, φ-F-harmonic, and φ-ΦS,p,ε harmonic maps. result Established Liouville theorem for the specified harmonic maps with free boundary.
Dirac-harmonic maps are uncoupled under certain conditions.
problem Understanding the uncoupling of Dirac-harmonic maps.
method Critical points of a super-symmetric energy functional, with focus on harmonic maps.
result Dirac-harmonic maps are uncoupled under minimality assumption.
We introduce slant Riemannian maps from Riemannian manifolds to almost Hermitian manifolds as a generalization of slant immersions, invariant Riemannian maps and anti-invariant Riemannian maps. We give examples, obtain characterizations and investigate the harmonicity of such maps. We also obtain necessary and sufficie…
Analyzes harmonic and biharmonic maps from gradient Ricci solitons.
problem Characterizing maps from gradient Ricci solitons.
method Derives conditions for maps to be constant or harmonic.
result Biharmonic maps of finite energy from the two-dimensional cigar soliton are harmonic.
The paper studies maps from pseudo-Hermitian to Kähler manifolds, proving harmonic map properties.
problem Analyzing maps between pseudo-Hermitian and Kähler manifolds.
method Investigates partial energy functionals and critical maps, proving foliated results for ∂b- and ∂b-harmonic maps. result Generalizes Siu's holomorphicity result to ∂b- and ∂b-harmonic maps. In this paper, we show that one can interrelate pluriharmonic maps with para-pluriharmonic maps by means of the loop group method. As an appendix, we give examples for the interrelation between pluriharmonic maps and para-pluriharmonic maps. Moreover, we investigate the relation among CMC-surfaces by use of such maps.
The article explores constructing biharmonic and conformal biharmonic maps to spheres.
problem Constructing biharmonic and conformal biharmonic maps to spheres.
method Geometric algorithm to render harmonic maps biharmonic or conformally biharmonic.
result Explicit critical points for conformal-biharmonic maps between spheres are found.
Harmonic map flow preserves almost-holomorphic maps without singularities.
problem Preserving almost-holomorphic maps without singularities.
method Harmonic map flow applied to almost-holomorphic maps.
result No singularities or necks appear in the limit at singular times.
Method computes harmonic and conformal maps from point clouds.
problem Computing maps from irregular point cloud data.
method Meshless method using cubic lattice approximations.
result Harmonic and conformal maps computed accurately.
New theorem proves convergence of various discrete conformal structures to conformal maps.
problem Proving convergence of discrete conformal structures to conformal maps.
method General theorem using piecewise linear discrete conformal mappings and Riemannian barycentric coordinates.
result Discrete conformal mappings converge to conformal maps under certain conditions.
Constructs harmonic maps between special geometric shapes.
problem Creating harmonic maps between specific types of geometric shapes.
method Equivariant harmonic maps constructed between cohomogeneity one manifolds.
result Developed a method to construct harmonic maps.
Study on harmonic maps between cones, linking degrees to graph Laplacian eigenvalues.
problem Understanding harmonic maps between singular spaces.
method Analyzing homogeneous harmonic maps between simplicial cones and their degrees.
result Degrees of homogeneous harmonic maps are related to eigenvalues of discrete graph Laplacians.
Study isotropic Riemannian maps and helices along them.
problem Understanding Riemannian maps and their associated helices.
method Presented isotropic Riemannian maps and characterized helices along them.
result Characterization of helices along Riemannian maps.
Study on harmonic maps on weighted Riemannian foliations.
problem Characterize harmonic maps on weighted foliations.
method Analyze transversally f-harmonic and (F,F′)f-harmonic maps. result Equivalence of transversally f-harmonic and (F,F′)f-harmonic maps in minimal foliations. Maps and measures on surfaces link best Lipschitz and least gradient functions.
problem Analyzing maps between surfaces and their geometric properties.
method Duality between best Lipschitz and least gradient maps, geodesic laminations, and transverse measures.
result The infinity harmonic map defines a geodesic lamination and the least gradient map defines a transverse measure.