We complete the classification of rank two affine manifolds in the moduli space of translation surfaces in genus three. Combined with a recent result of Mirzakhani and Wright, this completes the classification of higher rank affine manifolds in genus three.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,932 papers · 148 categories
Trend · papers per month
48 results for “affine combination”
New algorithm estimates task affinities without repeated training, improving model performance and efficiency.
problem Efficiently estimating task affinities among multiple tasks for model training.
method Grad-TAG algorithm: trains a base model for all tasks and uses gradient-based linearization to estimate task affinities.
result Estimates task affinities with high accuracy and low computational cost.
In this paper we classify convex compact ancient solutions to the affine curve shortening flow: namely, any convex compact ancient solution to the affine curve shortening flow must be a shrinking ellipse. The method combines a rescaling argument inspired by \cite{Wang}, affine invariance of the equation and monotonicit…
Affine Harmonic Mapsmath.DG
We introduce a class of maps from an affine flat into a Riemannian manifold that solve an elliptic system defined by the natural second order elliptic operator of the affine structure and the nonlinear Riemann geometry of the target. These maps are called affine harmonic. We show an existence result for affine harmonic…
Smooth manifolds have been always understood intuitively as spaces with an affine geometry on the infinitesimal scale. In Synthetic Differential Geometry this can be made precise by showing that a smooth manifold carries a natural structure of an infinitesimally affine space. This structure is comprised of two pieces o…
Paper proves certain closed affine manifolds without invariant lines don't exist.
problem Proving non-existence of closed affine manifolds with invariant lines.
method Developing map, holonomy, invariant line, large open subsets, modified proof.
result Developing image cannot meet invariant line if affine holonomy acts purely by translations.
Paper shows affine constraint is unnecessary for high-dimensional data.
problem The necessity of an affine constraint in affine subspace clustering.
method Theoretical and empirical analysis of conditions for correctness of affine subspace clustering methods.
result Affine constraint has negligible effect on clustering performance for high-dimensional data.
New method for multiway clustering of 3rd order tensors.
problem Clustering of 3rd order tensors.
method MCAM method based on affinity matrix and clustering.
result Competitive results on synthetic and real datasets.
This article investigates parameter estimation of affine term structure models by means of the generalized method of moments. Exact moments of the affine latent process as well as of the yields are obtained by using results derived for p-polynomial processes. Then the generalized method of moments, combined with Quasi-…
Transforms classical connections using pushforwards and gauge transformations.
problem Transforming classical connections in categorical settings.
method Constructing pushforwards and applying gauge transformations to decorated path spaces.
result Combines traditional gauge transformation with affine translation.
We introduce a multiple curve framework that combines tractable dynamics and semi-analytic pricing formulas with positive interest rates and basis spreads. Negatives rates and positive spreads can also be accommodated in this framework. The dynamics of OIS and LIBOR rates are specified following the methodology of the …
Improves MCMC performance with adaptive affine transformations.
problem Improving the performance of Markov Chain Monte Carlo samplers.
method Adaptive learning of bijective affine transformations during sampling.
result Adaptive affine transformations improve the quality of samples at low computational cost.
This paper is a continuation of the previous paper of the author[M]. We show that an affine deformation space of a hyperbolic surface of type (g,b) can be parametrized by Margulis invariants and affine twist parameters with a certain decomposition of the surface, which are associated with the Fenchel-Nielsen coordinate…
Examines the linear independence of curvature tensors and pseudotensors in non-symmetric affine connection spaces.
problem Determining the linear independence of curvature tensors and pseudotensors in non-symmetric affine connection spaces.
method Analyzes the number of covariant derivatives and curvature tensors/pseudotensors required for a complete study, and examines their linear independence.
result Identifies the number of curvature tensors and pseudotensors that are linearly independent in non-symmetric affine connection spaces.
Max-affine regression method converges linearly using GD and SGD.
problem Regression of max-affine models in signal processing and statistics.
method Gradient descent and mini-batch stochastic gradient descent analysis.
result GD and SGD converge linearly to a neighborhood of the ground truth under sub-Gaussian assumptions.
Dual Bayesian Affine Estimators for Wiener-type state-space models
problem Estimating parameters in Wiener-type state-space models
method Fixed-point architecture combining two affine estimators
result Dual basis-parameter estimator achieves comparable parameter MSE to purely affine estimator
The paper calculates bounds on the local Lipschitz constants of neural network layers.
problem Understanding the Lipschitz constants of neural network layers for robustness analysis.
method Analytical approach to determine upper bounds on local Lipschitz constants of affine-ReLU functions.
result The method produces tighter bounds than the standard conservative bound, especially for small perturbations.
Develops a unified framework for valuing insurance products with guarantees.
problem Valuing insurance products with guarantees in an affine setting.
method General affine approach to model financial markets, mortality, and policyholder behavior.
result Explicit valuation formulas for variable annuities and related contracts derived.
A recently proposed clustering method, called the Nearest Descent (ND), can organize the whole dataset into a sparsely connected graph, called the In-tree. This ND-based Intree structure proves able to reveal the clustering structure underlying the dataset, except one imperfect place, that is, there are some undesired …
Solves a 45-year-old Poincaré Conjecture using geometrization of 3-manifolds.
problem Proving the Poincaré Conjecture for 3-manifolds.
method Combining four geometries in Lie form and using affine geometry for edge regions.
result Proves the Poincaré Conjecture for 3-manifolds using Thurston's geometrization.
Let be an ordered abelian group. We show how an group -- that is, a group admitting a free affine action without inversions on a -tree -- admits a natural graph of groups decomposition, where vertex groups inherit actions on -trees. Using recent work o…
New conical metrics found on toric varieties with convex cones.
problem Finding conical metrics on toric affine varieties.
method Existence result for inhomogeneous Monge-Ampere equation, transversal a priori estimates.
result Existence of conical Ricci flat Kahler metrics on Q-Gorenstein affine toric varieties.
LCRSR recovers latent row space for multi-view clustering.
problem Efficiently recover latent representation from multiple views.
method LCRSR assumes latent representation from multiple views, recovers row space, and determines subspace membership.
result LCRSR recovers complete subspace structure efficiently.
New unsupervised image translation method detects changes without labeled data.
problem Detecting changes in images without labeled data.
method Affinity-based change priors and weighted loss functions trained on convolutional neural networks.
result Proposed method outperforms state-of-the-art algorithms in detecting changes.
Identifying components and estimating mixing weights in unlabeled finite mixtures under marginal independence.
problem Identifying components and estimating mixing weights in unlabeled finite mixtures.
method Proving structural results and extending them to observable mixtures.
result Identifying components and estimating mixing weights under marginal independence.
Solves partial assignment problems using random clique complexes.
problem Partial assignment problems, especially with severe occlusions and distortions.
method Formulate as matching random clique complexes, analyze k-skeletons, match adjacency matrices, consider geometric neighbourhoods.
result Outperforms diverse matching algorithms significantly.
We propose and study a row-and-column affine measurement scheme for low-rank matrix recovery. Each measurement is a linear combination of elements in one row or one column of a matrix . This setting arises naturally in applications from different domains. However, current algorithms developed for standard matrix rec…
New shape representation for airfoils improves design and manufacturing.
problem Designing and manufacturing airfoils efficiently and accurately.
method Combining physics-based and data-driven techniques on a Grassmannian manifold.
result Rich set of novel 2D airfoil deformations not previously captured.
Max-affine regression tackles estimating coefficients of up to k affine functions.
problem Estimating coefficients of up to k affine functions in a high-dimensional setting.
method Alternating minimization (AM) algorithm for non-convex least squares objective, with spectral method and random search initialization.
result AM algorithm converges geometrically to near-optimal coefficients with high probability.
New AMP algorithm estimates signals and latent variables in mixed regression models.
problem Estimating signals and latent variables in mixed regression models.
method Approximate Message Passing (AMP) algorithm for matrix GLM.
result State evolution recursion and optimal denoising functions for precise error minimization.
We propose a specialized string kernel for small bio-molecules, peptides and pseudo-sequences of binding interfaces. The kernel incorporates physico-chemical properties of amino acids and elegantly generalize eight kernels, such as the Oligo, the Weighted Degree, the Blended Spectrum, and the Radial Basis Function. We …
Performance Analysis of Spectral Clustering on Compressed, Incomplete and Inaccurate Measurementsmath.NA
Spectral clustering is one of the most widely used techniques for extracting the underlying global structure of a data set. Compressed sensing and matrix completion have emerged as prevailing methods for efficiently recovering sparse and partially observed signals respectively. We combine the distance preserving measur…
The Straight-Through Estimator (STE) is widely used for back-propagating gradients through the quantization function, but the STE technique lacks a complete theoretical understanding. We propose an alternative methodology called alpha-blending (AB), which quantizes neural networks to low-precision using stochastic grad…
Switching to non-affine stochastic volatility: A closed-form expansion for the Inverse Gamma modelq-fin.CP
This paper introduces the Inverse Gamma (IGa) stochastic volatility model with time-dependent parameters, defined by the volatility dynamics . This non-affine model is much more realistic than classical affine models like the Heston stochastic volatility model, e…
Spectral clustering improves accuracy and efficiency for clustering discrete distributions.
problem Inaccurate clustering of discrete distributions using traditional methods.
method Spectral clustering combined with distribution affinity measures (MMD, Wasserstein distance) and linear optimal transport.
result Spectral clustering outperforms traditional methods in accuracy and efficiency.
Study of flows on complex manifolds with holomorphic properties.
problem Global rigidity of transversely holomorphic Anosov flows on smooth compact manifolds.
method Analyzing the integrability of unstable and stable distributions, proving uniqueness in low dimensions.
result For topologically transitive flows, they are either orbit equivalent to a hyperbolic automorphism or geodesic flow.
This paper discusses the exact simulation of the stock price process underlying the 3/2 model. Using a result derived by Craddock and Lennox using Lie Symmetry Analysis, we adapt the Broadie-Kaya algorithm for the simulation of affine processes to the 3/2 model. We also discuss variance reduction techniques and find th…
Almost Zoll affine surface found on cylinder.
problem Finding surfaces with special geodesic properties.
method Exhibited an affine structure on a cylinder.
result Affine structure on cylinder is almost Zoll.
In this paper, we propose new conditions guaranteeing that the trajectories of a mechanical control system can track any curve on the configuration manifold. We focus on systems that can be represented as forced affine connection control systems and we generalize the sufficient conditions for tracking known in the lite…
On the dimension of limit sets on via stationary measures: variational principles and applicationsmath.DS
The paper studies the dimension of limit sets using variational principles and stationary measures.
problem Calculating the Hausdorff dimension of limit sets of Anosov representations and the Rauzy gasket.
method Established variational principles for affinity exponents and Rauzy gaskets, combined with dimension formulas of stationary measures.
result Yields the equality between the Hausdorff dimensions and affinity exponents in both settings.
Study proves existence, uniqueness, and stability for specific stochastic Volterra equations.
problem Analyzing existence, uniqueness, and stability of affine stochastic Volterra equations with -kernels.
method Approximations with -kernels, stability result, duality argument, deterministic Riccati--Volterra integral equation.
result Established weak uniqueness for the equations using Fourier--Laplace transform and a deterministic Riccati--Volterra integral equation.
Fibres affinesmath.DG
We study affine maps between affine manifolds. Even when the fibers are compact and diffeomorphic, two of them can inherit different affine structures from the source space. This leads to a fixed linear holonomy deformation theory of the affine structure of an affine manifold. We found various conditions which make the…
Paper presents an efficient algorithm for estimating Lipschitz functions from noisy data.
problem Estimating unknown Lipschitz functions from noisy observations.
method Extends max-affine methods to Lipschitz setting using nonlinear feature expansion and adaptive partitioning.
result Achieves minimax convergence rate with respect to intrinsic dimension, up to logarithmic factors.
In this article, we propose the notion of the general -affine capacity and prove some basic properties for the general -affine capacity, such as affine invariance and monotonicity. The newly proposed general -affine capacity is compared with several classical geometric quantities, e.g., the volume, the -var…
In this paper, we show that a compact affine manifold endowed with an Affine Anosov transformation is finitely covered by a complete affine nilmanifold.
An affine manifold is a manifold with torsion-free flat affine connection. A geometric topologist's definition of an affine manifold is a manifold with an atlas of charts to the affine space with affine transition functions; a radiant affine manifold is an affine manifold with holonomy consisting of affine transformati…
Proofs for decomposing branched affine surfaces into triangles and cylinders.
problem Decomposing branched affine surfaces into simpler geometric shapes.
method Proof of Veech's theorem and introduction of invariant α.
result Any pair of decompositions can be connected by flips.
An affine manifold is said to be geodesically complete if all affine geodesics extend for all time. It is said to be affine Killing complete if the integral curves for any affine Killing vector field extend for all time. We use the solution space of the quasi-Einstein equation to examine these concepts in the setting o…