Research
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,786 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Jul 199219922001200920172026
48 results for Brouwer's invariance of domain

New tiles in higher dimensions are shown to be homeomorphic to balls.

problem Characterizing self-affine tiles in higher dimensions as balls.
method Using Brouwer's invariance of domain theorem and a horizontal distance tool.
result Necessary and sufficient conditions for tiles to be dd-dimensional tame balls.

Recent proofs of classical theorems in polynomial algebra and functional analysis are discussed, which use tools from the topology of real manifolds. Simpler proofs were discovered in the new century, of the Hilbert Nullstellensatz, and the Gelfand-Mazur Theorem. We give a related proof that an irreducible real polynom…

2015-02-01abs ↗pdf ↗

We give new tools for homotopy Brouwer theory. In particular, we describe a canonical reducing set (the set of "walls") which splits the plane into maximal translation areas and irreducible areas. We then focus on Brouwer mapping classes relatively to four orbits and describe them explicitly by adding to Handel's diagr…

2015-07-10abs ↗pdf ↗

The proof of Brouwer's fixed-point theorem based on Sperner's lemma is often presented as an elementary combinatorial alternative to advanced proofs based on algebraic topology. The goal of this note is to show that: (i) the combinatorial proof of Sperner's Lemma can be considered as a cochain-level version, written in…

2009-06-29abs ↗pdf ↗

This is a mathematical commentary on Teichm{ü}ller's paper ``Bestimmung der extremalen quasikonformen Abbildungen bei geschlossenen orientierten Riemannschen Fl{ä}chen'' (Determination of extremal quasiconformal maps of closed oriented Riemann surfaces). This paper is among the last (and may be the last one) that Teich…

2015-10-09abs ↗pdf ↗

Paper extends Brouwer Fixed Point Theorem with amiable and almost amiable fixed sets.

problem Extending the Brouwer Fixed Point Theorem to approximate fixed sets.
method Introducing shape boundary regions in CW spaces as amiable and almost amiable fixed subsets of dpc maps.
result Variation of Jordan Curve Theorem and Fixed Cell Complex Theorem.

We give an answer to the question given by T.Y.Kong in his article "Can 3-D Digital Topology be Based on Axiomatically Defined Digital Spaces?" In this article he asks the question, if so called "good pairs" of neighborhood relations can be found on the set Z^n such that the existence of digital manifolds of dimension …

2011-11-13abs ↗pdf ↗

A new technique for the study of geodesic connectedness in a class of Lorentzian manifolds is introduced. It is based on arguments of Brouwer's topological degree for the solution of functional equations. It is shown to be very useful for multiwarped spacetimes, which include different types of relativistic spacetimes.

1999-09-14abs ↗pdf ↗

The paper generalizes Sperner's lemma to higher dimensions and calculates a new invariant.

problem Generalizing Sperner's lemma to higher dimensions and quantifying its outcomes.
method Using triangulations of (m+1)(m+1)-discs and simplicial mappings, the authors define a new invariant and prove a theorem about fully colored simplices.
result The number of fully colored simplices is not less than the new invariant μ([f]).

Paper proves a new criterion for time-like geodesics in flat spacetimes.

problem Existence and nature of time-like geodesics in asymptotically flat spacetimes.
method Generalized topological criterion using the Jordan-Brouwer Separation Theorem and differential geometry.
result Conclusively affirms the presence of time-like geodesics intersecting transversally.

A new method improves cross-domain sentiment analysis by learning weighted domain-invariant representations.

problem Label distribution changes across domains harm domain adaptation in DIRL.
method Proposes WDIRL, a modification to DIRL that learns weighted domain-invariant representations.
result Empirical studies show the effectiveness of WDIRL in cross-domain sentiment analysis.

New method improves domain generalization by aligning causal mechanisms across domains.

problem Improving model's ability to generalize across different distributions.
method Introduces invariance of average causal effect of features to labels, regularizing training approach.
result Demonstrates superior performance on benchmark datasets compared to state-of-the-art methods.

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.

This paper investigates domain generalization: How to take knowledge acquired from an arbitrary number of related domains and apply it to previously unseen domains? We propose Domain-Invariant Component Analysis (DICA), a kernel-based optimization algorithm that learns an invariant transformation by minimizing the diss…

2013-01-10abs ↗pdf ↗

The paper studies invariant weighted Bergman metrics on domains.

problem Investigating invariant weighted Bergman metrics under biholomorphisms.
method Introducing invariant weight assignments, using Bergman's minimum integral method and domain version of Tian-Yau-Zelditch expansion.
result Uniform convergence of weighted Bergman kernels and metrics on uniform squeezing domains.

The paper explores how to make machine learning models robust to domain shifts.

problem Machine learning models are unreliable in domains different from training.
method Introducing a broad formal notion of invariance and causal structures.
result The true underlying causal structure of the data plays a critical role in robustness.

Paper develops upper-bounds for target general loss in multiple source DA and DG settings.

problem Complexity and trade-offs in multiple source domain adaptation and domain generalization.
method Defines two types of domain-invariant representations and studies their pros, cons, and trade-offs.
result Developed upper-bounds for target general loss offer insights into domain-invariant representations.

The paper proposes a method to create domain-invariant representations using Wasserstein distance.

problem Domain shifts in training data affect machine learning model performance across different domains.
method The method combines classification/regression losses with a GAN-type discriminator to minimize the Wasserstein distance between domains.
result The approach produces the highest minimum classification accuracy and most invariant representation across domains.

New approach improves domain adaptation by enforcing cluster assumption in target domain.

problem Lack of robustness in target classifier due to violation of cluster assumption.
method Enforces cluster assumption in target domain (Target Consistency) paired with Class-Level InVariance.
result Significant improvement in image classification and segmentation benchmarks.

Domain generalization aims to apply knowledge gained from multiple labeled source domains to unseen target domains. The main difficulty comes from the dataset bias: training data and test data have different distributions, and the training set contains heterogeneous samples from different distributions. Let XX denote …

2018-07-23abs ↗pdf ↗

A new IL framework estimates invariant predictors with single domain data.

problem Deep networks inherit spurious correlations and fail on unseen domains.
method Assumes multiple labeled domains for higher-level tasks, uses single domain for target task, employs cross-validation for hyperparameter selection.
result Empirically demonstrates effectiveness and correctness of hyperparameter selection.

Adversarial techniques learn invariant representations across multiple domains.

problem Domain generalization from diverse studies to unseen domains.
method Adversarial censoring techniques for invariant representation learning.
result Limiting behavior of adversarial loss function as the number of domains grows.

Surgery triangles are an important computational tool in Floer homology. Given a connected oriented surface ΣΣ, we consider the abelian group K(Σ)K(Σ) generated by bordered 3-manifolds with boundary ΣΣ, modulo the relation that the three manifolds involved in any surgery triangle sum to zero. We show that K(Σ)K(Σ) is a f…

2014-10-14abs ↗pdf ↗

Transfer learning aims to improve learning in target domain by borrowing knowledge from a related but different source domain. To reduce the distribution shift between source and target domains, recent methods have focused on exploring invariant representations that have similar distributions across domains. However, w…

2017-07-31abs ↗pdf ↗

Proposes an alternative invariance penalty to address domain generalization issues.

problem Addressing domain generalization problems by finding invariant representations.
method Revisits the Gramian matrix of the data representation to propose an alternative invariance penalty.
result The proposed approach guarantees recovery of an invariant representation under mild conditions.

Improves transferability of representations from source to target domains with weights and invariant representations.

problem Label shift between source and target domains in unsupervised domain adaptation.
method Integrates weights and invariant representations to bound the target risk, highlighting the role of inductive bias.
result Empirical evidence shows that weak inductive bias makes adaptation more robust.

Paper shows regularization improves robustness in domain generalization.

problem Improving robustness in domain generalization.
method Derives novel theoretical analysis to control representation smoothness and proposes a regularization method.
result Regularization improves robustness in domain generalization.

We answer the question of when a new point can be added in a continuous way to configurations of nn distinct points in a closed ball of arbitrary dimension. We show that this is possible given an ordered configuration of nn points if and only if n1n \neq 1. On the other hand, when the points are not ordered and the d…

2018-09-18abs ↗pdf ↗

Interventional domain adaptation improves feature transferability by removing spurious correlations.

problem Improper feature transferability due to spurious correlations in domain adaptation.
method Intervention strategy using unlabeled target data to generate counterfactual features and train discriminability invariance.
result Consistent performance improvements over state-of-the-art approaches in various domain adaptation tasks.

New invariant defined for Weinstein domains, related to Kirby-Thompson's invariant.

problem Defining a symplectic invariant for Weinstein domains.
method Contact cut graph, Lefschetz fibrations, multisections with divides.
result Definition of Weinstein L\mathcal{L}-invariant and its relation to Kirby-Thompson's invariant.

Estimates model performance under distribution shift using domain-invariant predictors.

problem Poor performance of models on test distributions different from training distributions.
method Uses domain-invariant predictors as a proxy for unknown target labels.
result Shows that the complexity of latent representations influences target risk.

We prove a discrete Jordan-Brouwer-Schoenflies separation theorem telling that a (d-1)-sphere H embedded in a d-sphere G defines two different connected graphs A,B in G such a way that the intersection of A and B is H and the union is G and such that the complementary graphs A,B are both d-balls. The graph theoretic de…

2015-06-22abs ↗pdf ↗

M Handel has proved in [Topology 38 (1999) 235--264] a fixed point theorem for an orientation preserving homeomorphism of the open unit disk, that may be extended to the closed disk and that satisfies a linking property of orbits. We give here a new proof of Handel's fixed point theorem, based on Brouwer theory and som…

2009-03-02abs ↗pdf ↗