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

Trend · papers per month

4693139185 · Jun 202019922001200920172026
48 results for flip map

Study of flip graphs and their automorphism groups for infinite-type surfaces.

problem Understanding automorphism groups of flip graphs for infinite-type surfaces.
method Examined the relationship between mapping class groups and flip graphs for infinite-type surfaces.
result Extended mapping class groups are isomorphic to proper subgroups of automorphism groups of flip graphs.

Study quasisymmetric maps on hyperbolic plane boundaries.

problem Identify quasisymmetric maps corresponding to specific lambda lengths and flip distances.
method Analyze maps on Farey triangulation, relate to shearing coordinates and flip distance.
result Identify quasisymmetric maps corresponding to pinched lambda lengths and flip distances.

We prove that every injective simplicial map F(S)F(S)\mathcal{F}(S) \to \mathcal{F}(S') between flip graphs is induced by a subsurface inclusion SSS\to S', except in finitely many cases. This extends a result of Korkmaz--Papadopoulos which asserts that every automorphism of the flip graph of a surface without boundary is ind…

2014-09-24abs ↗pdf ↗

This paper is about the geometry of flip-graphs associated to triangulations of surfaces. More precisely, we consider a topological surface with a privileged boundary curve and study the spaces of its triangulations with n vertices on the boundary curve. The surfaces we consider topologically fill this boundary curve s…

2014-07-06abs ↗pdf ↗

The space of topological decompositions into triangulations of a surface has a natural graph structure where two triangulations share an edge if they are related by a so-called flip. This space is a sort of combinatorial Teichmüller space and is quasi-isometric to the underlying mapping class group. We study this space…

2014-11-16abs ↗pdf ↗

The study classifies tilings of the sphere by congruent quadrilaterals.

problem Classifying edge-to-edge tilings of the sphere by congruent quadrilaterals.
method Classification of tilings into three classes based on geometric data and parameters.
result Three classes of tilings are identified: 2-layer earth map tilings, quadrilateral subdivisions of the octahedron, and 3-layer earth map tilings.

Study flip graphs for surfaces of infinite type, finding uncountably many connected components.

problem Understanding relationships between triangulations of infinite type surfaces via flips.
method Associate triangulations to flip graphs and study sequences of simultaneous flips.
result Flip graphs for infinite type surfaces have uncountably many connected components.

This article is about the graph genus of certain well studied graphs in surface theory: the curve, pants and flip graphs. We study both the genus of these graphs and the genus of their quotients by the mapping class group. The full graphs, except for in some low complexity cases, all have infinite genus. The curve grap…

2014-10-29abs ↗pdf ↗

Study shows flipping a small subset of labels can severely damage machine learning models.

problem Adversarial attacks on distributed machine learning models.
method Formalized label flipping attacks, proposed a greedy algorithm, demonstrated with logistic regression models.
result A budget of only 0.1% of labels at each training step can reduce model accuracy by 6%, and some models can perform worse than random guessing when up to 25% of labels are flipped.

Neural networks have been criticized for their lack of easy interpretation, which undermines confidence in their use for important applications. Here, we introduce a novel technique, interpreting a trained neural network by investigating its flip points. A flip point is any point that lies on the boundary between two o…

2019-03-21abs ↗pdf ↗

An R_2-move is a homotopy of wrinkled fibrations which deforms images of indefinite fold singularities like Reidemeister move of type II. Variants of this move are contained in several important deformations of wrinkled fibrations, flip and slip for example. In this paper, we first investigate how monodromies are chang…

2012-03-20abs ↗pdf ↗

Efficiently poisons offline RLHF models by flipping preference labels.

problem Vulnerability of offline RLHF models to preference label flipping attacks.
method Developed two attack methods: BAL-A and BMP-A, solving a structured binary sparse approximation problem.
result Demonstrated that flipping one preference label induces a parameter-independent shift in the DPO gradient, enabling structured binary sparse approximation.

New examples show flip distance and polyhedron triangulation numbers differ, with ratio close to 3/2.

problem Understanding the relationship between flip distance and polyhedron triangulation numbers.
method Provided examples to demonstrate the difference between flip distance and polyhedron triangulation numbers.
result Ratio of flip distance to polyhedron triangulation numbers can be arbitrarily close to 3/2.

The paper calculates ranks and bounds for Stiefel manifolds over different fields.

problem Computing ranks and bounds for Stiefel manifolds over various fields.
method Computation of upper characteristic ranks and cup lengths, providing bounds and necessary conditions for maps.
result Bounds and necessary conditions for S3S^3-maps between quaternionic Stiefel manifolds.

The paper bounds distances and transformations between pants decompositions and triangulations on surfaces.

problem Finding bounds on distances and transformations between pants decompositions and triangulations.
method Using pre-triangulations, train tracks, and Agol-Hass-Thurston algorithm.
result Upper bounds on distances and transformations between pants decompositions and triangulations.

We introduce a notion of cross-flips: local moves that transform a balanced (i.e., properly (d+1)(d+1)-colored) triangulation of a combinatorial dd-manifold into another balanced triangulation. These moves form a natural analog of bistellar flips (also known as Pachner moves). Specifically, we establish the following the…

2015-12-14abs ↗pdf ↗

In this paper, we investigate a family of graphs associated to collections of arcs on surfaces. These {\it multiarc graphs} naturally interpolate between arc graphs and flip graphs, both well studied objects in low dimensional geometry and topology. We show a number of rigidity results, namely showing that, under certa…

2019-02-28abs ↗pdf ↗

In order to model volatile real-world network behavior, we analyze phase-flipping dynamical scale-free network in which nodes and links fail and recover. We investigate how stochasticity in a parameter governing the recovery process affects phase-flipping dynamics, and find the probability that no more than q% of nodes…

2014-01-29abs ↗pdf ↗

Let ΣΣ be a compact surface. We prove that the set of surface cubications modulo flips, up to isotopy, is in one-to-one correspondence with Z/2ZH1(Σ,Z/2Z)\Z/2\Z\oplus H_1(Σ,\Z/2\Z).

2005-01-31abs ↗pdf ↗

We use flip points to explain and audit deep learning models, revealing decision boundaries and improving model performance.

problem Lack of interpretability in deep learning models hinders their use in important applications.
method Flip points are used to analyze decision boundaries of deep learning models with continuous output scores.
result Flip points reveal the least changes in input that would alter a model's classification, enabling better understanding and improvement of model behavior.

Study finds flipped classrooms improve student self-concept, enjoyment, but not exam scores.

problem Evaluating the impact of flipped classrooms on higher education outcomes.
method Double/debiased machine learning (DML) approach to analyze student data.
result No significant positive effects on exam scores, passing rates, or knowledge retention.

We discuss the geometry of the c-map from projective special Kähler to quaternionic Kähler manifolds using the twist construction to provide a global approach to Hitchin's description. As found by Alexandrov et al. and Alekseevsky et al. this is related to the quaternionic flip of Haydys. We prove uniqueness statements…

2014-04-03abs ↗pdf ↗

We study flip-graphs of triangulations on topological surfaces where distance is measured by counting the number of necessary flip operations between two triangulations. We focus on surfaces of positive genus gg with a single boundary curve and nn marked points on this curve; we consider triangulations up to homeomor…

2015-10-26abs ↗pdf ↗

Using existing technology, we prove a Masur-Minsky style distance formula for flip- graph distance between two triangulations, expressed as a sum of the distances of the projections of these triangulations into arc graphs of the suitable subsurfaces of S.

2015-11-16abs ↗pdf ↗

We investigate a type of distance between triangulations on finite type surfaces where one moves between triangulations by performing simultaneous flips. We consider triangulations up to homeomorphism and our main results are upper bounds on distance between triangulations that only depend on the topology of the surfac…

2015-09-14abs ↗pdf ↗

Deep Partition Aggregation defends against poisoning attacks with provable certificates.

problem Adversarial poisoning attacks corrupt classifier test-time behavior.
method Deep Partition Aggregation (DPA) is an ensemble method using hash partitions and base models trained on these partitions.
result DPA can certify >= 50% of test images against over 500 poison image insertions on MNIST, and nine insertions on CIFAR-10.

In this paper we develop a Morse-like theory in order to decompose birational maps and morphisms of smooth projective varieties defined over a field of characteristic zero into more elementary steps which are locally étale isomorphic to equivariant flips, blow-ups and blow-downs of toric varieties. A crucial role in th…

1999-04-15abs ↗pdf ↗

New method makes machine learning models robust to label flipping attacks.

problem Machine learning models are vulnerable to label flipping attacks.
method Randomized smoothing over arbitrary functions to build certifiably robust classifiers.
result Linear classifiers are robust to label flipping attacks with deterministic bounds.

We explore several families of flip-graphs, all related to polygons or punctured polygons. In particular, we consider the topological flip-graphs of once-punctured polygons which, in turn, contain all possible geometric flip-graphs of polygons with a marked point as embedded sub-graphs. Our main focus is on the geometr…

2016-02-15abs ↗pdf ↗

Many machine learning systems rely on data collected in the wild from untrusted sources, exposing the learning algorithms to data poisoning. Attackers can inject malicious data in the training dataset to subvert the learning process, compromising the performance of the algorithm producing errors in a targeted or an ind…

2018-03-02abs ↗pdf ↗

Proof of existence and uniqueness of weighted Voronoi-Delaunay on polyhedral surfaces.

problem Existence and uniqueness of weighted Voronoi-Delaunay on polyhedral surfaces.
method Construct an isotopic map instead of edge-flipping algorithm, generalizing Dyer et al's method.
result Strict proof of existence and uniqueness of weighted Voronoi-Delaunay on polyhedral surfaces.

The study examines flip-graphs of non-orientable surfaces and their diameters.

problem Understanding the structure and diameter of flip-graphs of non-orientable surfaces.
method Constructing triangulations of non-orientable surfaces, quotienting by homeomorphisms, and analyzing the resulting flip-graphs.
result Bounds on the diameter of flip-graphs of non-orientable surfaces, with specific growth rates for Möbius strips.