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

Trend · papers per month

10202939 · Jun 202019922001200920172026
48 results for flip equivariance

We study the Morse theory of the Yang-Mills-Higgs functional on the space of pairs (A,Φ)(A,Φ), where AA is a unitary connection on a rank 2 hermitian vector bundle over a compact Riemann surface, and ΦΦ is a holomorphic section of (E,dA")(E, d_A"). We prove that a certain explicitly defined substratification of the Morse str…

2010-02-16abs ↗pdf ↗

We construct N=2{\cal N}=2 supersymmetric Yang-Mills theory on 4D manifolds with a Killing vector field with isolated fixed points. It turns out that for every fixed point one can allocate either instanton or anti-instanton contributions to the partition function, and that this is compatible with supersymmetry. The equi…

2018-12-16abs ↗pdf ↗

This work is a continuation of our previous paper arXiv:1812.06473 where we have constructed N=2{\cal N}=2 supersymmetric Yang-Mills theory on 4D manifolds with a Killing vector field with isolated fixed points. In this work we expand on the mathematical aspects of the theory, with a particular focus on its nature as a …

2019-04-29abs ↗pdf ↗

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.

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 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 ↗

Study of quantum decorated character stacks and their quantizations.

problem Quantization of decorated character stacks and their compatibility with cutting and gluing.
method Using stratified factorization homology, extend Fock and Goncharov's construction to include stacky points.
result Construction of categorical charts and flips on quantum decorated character stacks.

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.

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 ↗

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 ↗

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 ↗

We consider geometric triangulations of surfaces, i.e., triangulations whose edges can be realized by disjoint locally geodesic segments. We prove that the flip graph of geometric triangulations with fixed vertices of a flat torus or a closed hyperbolic surface is connected. We give upper bounds on the number of edge f…

2019-12-10abs ↗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 ↗

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.

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.

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 ↗

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.

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 ↗

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.

This paper explores using nonlinear control for robust logarithmic growth in coin flipping games.

problem Tackles the use of nonlinear control in recursive betting games with logarithmic growth.
method Formulates a robust nonlinear control problem for a simple coin flipping game, considering a probability range for the coin's bias.
result Provides a closed-form description of the optimal robust nonlinear controller, which outperforms linear controllers.

Double pants decompositions were introduced in our paper "Double pants decompositions of 2-surfaces" (Mosc. Math. J. 11 (2011), no. 2, 231-258, arXiv:1005.0073), together with a flip-twist groupoid acting on these decompositions. It was shown that flip-twist groupoid acts transitively on a certain topological class of …

2015-09-27abs ↗pdf ↗

Any two triangulations of a closed surface with the same number of vertices can be transformed into each other by a sequence of regular flips, provided the number of vertices exceeds a number N depending on the surface. Examples show that in general N is bigger than the minimal number of vertices of a triangulation. Th…

1999-03-23abs ↗pdf ↗

Over the past two decades, several consistent procedures have been designed to infer causal conclusions from observational data. We prove that if the true causal network might be an arbitrary, linear Gaussian network or a discrete Bayes network, then every unambiguous causal conclusion produced by a consistent method f…

2012-03-15abs ↗pdf ↗