We consider hyperbolic structures on the compression body C with genus 2 positive boundary and genus 1 negative boundary. Note that C deformation retracts to the union of the torus boundary and a single arc with its endpoints on the torus. We call this arc the core tunnel of C. We conjecture that, in any geometrically …
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,695 papers · 148 categories
Trend · papers per month
48 results for “Ford domains”
We show the existence of isometric (or Ford) fundamental regions for a large class of subgroups of the isometry group of any rank one Riemannian symmetric space of noncompact type. The proof does not use the classification of symmetric spaces. All hitherto known existence results of isometric fundamental regions and do…
In this paper, it is shown that a Fuchsian group, acting on the upper half-plane model for , admits a Ford domain which is also a Dirichlet domain, for some center, if and only if it is an index 2 subgroup of a reflection group. This is used to exhibit an example of a maximal arithmetic hyperbolic reflect…
Study complex reflections in 3D hyperbolic geometry, finding new representations.
problem Deforming groups in 3D complex hyperbolic geometry.
method Representations of abstract groups in PU(3,1), using Ford domains as guides.
result First nontrivial example of a discrete and faithful representation of a subgroup in PU(3,1).
We apply a spherical CR Dehn surgery theorem in order to obtain infinitely many Dehn surgeries of the Whitehead link complement that carry spherical CR structures. We consider as starting point the spherical CR uniformization of the Whitehead link complement constructed by Parker and Will, using a Ford domain in the co…
Study reveals hidden accidental parabolics in complex hyperbolic geometry.
problem Understanding hidden parabolics in complex hyperbolic geometry.
method New technique to show ideal boundary of Ford domain is an infinite-genus handlebody.
result 3-manifold at infinity of is the complement of chain link .
FoRDE uses input gradients to improve neural network ensembles.
problem Improving neural network ensembles for robustness and accuracy.
method Proposes FoRDE, an ensemble learning method based on ParVI, which repels function space by input gradients.
result FoRDE significantly outperforms DEs and other ensemble methods in accuracy and calibration.
Neural execution solves complex graph problems like bipartite matching.
problem Solving complex graph algorithms like maximum bipartite matching.
method Reduces bipartite matching to a flow problem and uses Ford-Fulkerson for maximum flow.
result Neural network achieves optimal matching almost 100% of the time.
New algorithm finds more arbitrage opportunities in DEXs.
problem Detecting arbitrage loops and non-loops in decentralized exchanges.
method Combining line graph and modified Moore-Bellman-Ford algorithm.
result Found more arbitrage loops and non-loops compared to existing methods.
This brief report (6 pages) was written in 1983 but never published. It concerns the hyperbolic 3-orbifolds obtained as quotients of hyperbolic 3-space by the group of invertible 2 by 2 matrices whose entries are integers in the imaginary quadratic extension of Q of discriminant D. For values D > -100 the topological t…
The paper classifies discrete complex hyperbolic triangle groups.
problem Classifying discrete complex hyperbolic triangle groups.
method Analyzing complex hyperbolic spaces and isometries.
result Classifies discrete complex hyperbolic -triangle groups for .
We prove that every finite-volume hyperbolic 3-manifold M with p > 0 cusps admits a canonical, complete, piecewise Euclidean CAT(0) metric, with a canonical projection to a CAT(0) spine K. Moreover, (a) the universal cover of M endowed with the CAT(0) metric is a union of Euclidean half-spaces, glued together by identi…
Study forecasts supply chain disruptions in automotive industry.
problem Operational disruptions in automotive supply chain cause financial losses.
method Constructed dataset of multivariate time series, used Attention Sequence to Sequence Deep Learning architecture.
result Model achieved 0.85 precision and 0.8 recall in QA phase across five plants.
We give a graphical theory of integral indefinite binary Hamiltonian forms analogous to the one by Conway for binary quadratic forms and the one of Bestvina-Savin for binary Hermitian forms. Given a maximal order in a definite quaternion algebra over , we define the waterworld of , analog…
The Wiener-Hopf factorization is obtained in closed form for a phase type approximation to the CGMY Lévy process. This allows, for the approximation, exact computation of first passage times to barrier levels via Laplace transform inversion. Calibration of the CGMY model to market option prices defines the risk neutral…
We present a new methodology to analyze large classes of (classical and rough) stochastic volatility models, with special regard to short-time and small noise formulae for option prices. Our main tool is the theory of regularity structures, which we use in the form of [Bayer et al; A regularity structure for rough vola…
In this paper, we study stochastic volatility models in regimes where the maturity is small, but large compared to the mean-reversion time of the stochastic volatility factor. The problem falls in the class of averaging/homogenization problems for nonlinear HJB-type equations where the "fast variable" lives in a noncom…
We consider rough stochastic volatility models where the driving noise of volatility has fractional scaling, in the "rough" regime of Hurst parameter . This regime recently attracted a lot of attention both from the statistical and option pricing point of view. With focus on the latter, we sharpen the large de…
Study of -rationals and their geometric properties, including deformed Farey triangulation and Springborn operations.
problem Geometry of -rationals and their properties.
method Construction and analysis of deformed Farey triangulation and deformed modular surface; definition and study of Springborn operations.
result Derivation of a formula for the -deformed midpoint and new -deformation of Markov numbers.
Graph Neural Networks (GNNs) are a powerful representational tool for solving problems on graph-structured inputs. In almost all cases so far, however, they have been applied to directly recovering a final solution from raw inputs, without explicit guidance on how to structure their problem-solving. Here, instead, we f…
We study fractional stochastic volatility models in which the volatility process is a positive continuous function of a continuous Gaussian process . Forde and Zhang established a large deviation principle for the log-price process in such a model under the assumptions that the function is globally…
We consider structural credit modeling in the important special case where the log-leverage ratio of the firm is a time-changed Brownian motion (TCBM) with the time-change taken to be an independent increasing process. Following the approach of Black and Cox, one defines the time of default to be the first passage time…
Graph Neural Networks align with dynamic programming, improving algorithmic reasoning.
problem Demonstrate and quantify alignment between GNNs and dynamic programming.
method Category theory and abstract algebra methods to expose intricate connection.
result Showed GNNs align with dynamic programming beyond individual algorithms.
The present work extends the randomized shortest-paths framework (RSP), interpolating between shortest-path and random-walk routing in a network, in three directions. First, it shows how to deal with equality constraints on a subset of transition probabilities and develops a generic algorithm for solving this constrain…
Agent learns to navigate uncertain 3D maps using a hybrid planner.
problem Planning in 3D environments with uncertain topological maps.
method Hierarchical strategy combining graph planner and local policy, data-driven learning with neural network.
result Machine learning can overcome missing information in probabilistic topological maps.
This work develops a generic framework, called the bag-of-paths (BoP), for link and network data analysis. The central idea is to assign a probability distribution on the set of all paths in a network. More precisely, a Gibbs-Boltzmann distribution is defined over a bag of paths in a network, that is, on a representati…
Study decision boundaries using heat diffusion and probabilistic techniques.
problem Understanding the geometry of decision boundaries in machine learning.
method Using Brownian motion and probabilistic techniques to analyze decision boundaries.
result Decision boundaries exhibit persistent 'wiggly and fuzzy' regions, even under adversarial attacks.
Method generates intermediate domains to align source and target domains.
problem Challenges of domain adaptation with significant domain divergence.
method Progressive domain augmentation via domain interpolation and multiple subspace alignment.
result Achieves state-of-the-art performance on multiple domain adaptation tasks.
Aims to eliminate domain bias in authentication without domain labels.
problem Authentication models are biased due to domain differences.
method Discover latent domains and eliminate domain difference alternately, using a meta-learning framework.
result Eliminates domain difference in authentication without domain labels.
Complementary Domain Adaptation and Generalization for Unsupervised Continual Domain Shift Learningcs.LG
CoDAG combines domain adaptation and generalization for unsupervised continual domain shift learning.
problem Acquiring knowledge in unsupervised continual domain shift learning.
method Complementary Domain Adaptation and Generalization (CoDAG) framework.
result CoDAG outperforms state-of-the-art models in all datasets and evaluation metrics.
DCASE 2022 Task 2 tackles domain shifts in ASD for machine condition monitoring.
problem Domain shifts change acoustic characteristics, affecting ASD performance.
method Domain generalization techniques to detect anomalies across unknown domains.
result Two types of domain generalization techniques were identified and analyzed.
Extends polydisk theorem to Hartogs domains over symmetric domains.
problem Rigidity phenomena in Riemannian manifolds.
method Extension of polydisk theorem to Hartogs domains over arbitrary symmetric domains.
result Dual of a Hartogs domain over a bounded symmetric domain admits no totally geodesic immersion into any compact Riemannian manifold.
Adaptive multi-domain learning reduces parameter count for efficient deep learning.
problem Different domains have varying complexity, leading to inefficient model training.
method Proposes adaptive parameterization to reduce model complexity without sacrificing performance.
result Efficient multi-domain learning solutions with far fewer parameters.
Recently multi-domain recommender systems have received much attention from researchers because they can solve cold-start problem as well as support for cross-selling. However, when applying into multi-domain items, although algorithms specifically addressing a single domain have many difficulties in capturing the spec…
Proposes novel losses for fine-grained categorical domain adaptation.
problem Fine-grained alignment of categories across domains in unsupervised domain adaptation.
method Joint category-domain classifier with adversarial training losses for both domain and category levels, and vicinal domain adaptation.
result Achieves state-of-the-art performance on benchmark datasets.
We address the problem of domain generalization where a decision function is learned from the data of several related domains, and the goal is to apply it on an unseen domain successfully. It is assumed that there is plenty of labeled data available in source domains (also called as training domain), but no labeled dat…
MetFA aligns source and target domains for cross-device image classification.
problem Learning discriminative class boundaries across different domains.
method Distance metric guided feature alignment (MetFA) for domain-invariant and discriminative feature extraction.
result MetFA outperforms state-of-the-art methods in cross-device image classification.
In this paper, we propose a simple model referred as Contradistinguisher (CTDR) for unsupervised domain adaptation whose objective is to jointly learn to contradistinguish on unlabeled target domain in a fully unsupervised manner along with prior knowledge acquired by supervised learning on an entirely different domain…
CSD learns a common component for domain generalization, outperforming existing methods.
problem Training models to generalize across unseen domains.
method CSD decomposes the model into a common and specific component, discarding the latter.
result CSD outperforms state-of-the-art domain generalization methods.
Method learns domain-specific representations without supervision.
problem Domain generalization without labeled data.
method Hierarchical variational autoencoder approach.
result Model generalizes to unseen domains without domain supervision.
A new method uses normalizing flows for gradual domain adaptation.
problem Difficulty in domain adaptation when source and target domains have a large gap.
method Proposes using normalizing flows to learn a transformation from target to Gaussian mixture distribution.
result Improves classification performance and mitigates the problem of gradual self-training failure.
We propose a method to infer domain-specific models such as classifiers for unseen domains, from which no data are given in the training phase, without domain semantic descriptors. When training and test distributions are different, standard supervised learning methods perform poorly. Zero-shot domain adaptation attemp…
Study shows how many domains are needed for generalization, using a new measure called domain shattering dimension.
problem How many domains are needed for domain generalization?
method Introduced a new combinatorial measure called the domain shattering dimension to model domain sample complexity.
result Established a tight quantitative relationship between domain shattering dimension and classic VC dimension.
TAROT enhances robustness and domain adaptability with domain-invariant features.
problem Developing models robust to adversarial attacks across diverse domains.
method Derives a new generalization bound and proposes TAROT algorithm.
result TAROT outperforms state-of-the-art methods in accuracy and robustness.
A new model for imputing missing values in time series data across domains.
problem Imputing missing values in time series data across domains with domain shifts and high missing rates.
method A diffusion-based imputation model that integrates shared spectral components and domain-specific temporal structures, with cross-domain consistency alignment.
result Our model effectively handles missing values and domain shifts, outperforming existing methods.
We define self-adjoint extensions of the Hodge Laplacian on Lipschitz domains in Riemannian manifolds, corresponding to either the absolute or the relative boundary condition, and examine regularity properties of these operators' domains and form domains. We obtain results valid for general Lipschitz domains, and stron…
We present CROSSGRAD, a method to use multi-domain training data to learn a classifier that generalizes to new domains. CROSSGRAD does not need an adaptation phase via labeled or unlabeled data, or domain features in the new domain. Most existing domain adaptation methods attempt to erase domain signals using technique…
Graph-Relational Domain Adaptation (GRDA) adapts domains based on their graph structure.
problem Uniform alignment of domains ignores topological structures.
method Uses a domain graph to encode adjacency and a novel graph discriminator.
result Empirically shows improved generalization and domain information incorporation.