New method for efficient graph learning on large graphs.
problem High memory complexity for graph learning on large, non-sparse graphs.
method Approximate large graphs as intersecting communities, using a new graph regularity lemma.
result Efficient graph learning algorithm with linear memory and time complexity.
Machine learning (ML) techniques are enjoying rapidly increasing adoption. However, designing and implementing the systems that support ML models in real-world deployments remains a significant obstacle, in large part due to the radically different development and deployment profile of modern ML methods, and the range …
The problem of secure friend discovery on a social network has long been proposed and studied. The requirement is that a pair of nodes can make befriending decisions with minimum information exposed to the other party. In this paper, we propose to use community detection to tackle the problem of secure friend discovery…
This paper explores advancements in neural network communication for distributed settings.
problem Challenges in training and evaluating neural networks in distributed, privacy-constrained environments.
method Development and evaluation of novel training and evaluation schemes for neural networks.
result Advantages of novel approaches over traditional cloud solutions, including privacy-preservation, increased security, and high training speed.
Distributed optimization often consists of two updating phases: local optimization and inter-node communication. Conventional approaches require working nodes to communicate with the server every one or few iterations to guarantee convergence. In this paper, we establish a completely different conclusion that each node…
Machine learning enhances cosmology through new tools and data analysis.
problem Leveraging machine learning in cosmology for better understanding of the universe.
method Development of new computational tools, data analysis techniques, and community building.
result Substantial potential in cosmology remains untapped with machine learning.
Study uses sentiment analysis to predict cryptocurrency token returns in virtual reality.
problem Predicting cryptocurrency token returns in virtual reality economies.
method Used BERT for sentiment analysis and developed LSTM models integrating multi-modal features.
result Multi-modal model significantly outperforms price-only baseline in prediction accuracy.
In many applications, the training data for a machine learning task is partitioned across multiple nodes, and aggregating this data may be infeasible due to communication, privacy, or storage constraints. Existing distributed optimization methods for learning global models in these settings typically aggregate local up…
New digital currency aims for equal wealth distribution.
problem Inequality in cryptocurrency wealth distribution.
method Egalitarian coin minting and joint minting across communities.
result Achieves global distributive justice in wealth distribution.
The VC-dimension of a set system is a way to capture its complexity and has been a key parameter studied extensively in machine learning and geometry communities. In this paper, we resolve two longstanding open problems on bounding the VC-dimension of two fundamental set systems: k-fold unions/intersections of half-s…
Model financial markets with social media influences using hierarchical networks.
problem Understanding social media's impact on financial markets.
method Agent-based model with hierarchical influence network.
result Model accurately simulates real-world financial market behaviors.
Intelligent Transportation Systems (ITSs) are envisioned to play a critical role in improving traffic flow and reducing congestion, which is a pervasive issue impacting urban areas around the globe. Rapidly advancing vehicular communication and edge cloud computation technologies provide key enablers for smart traffic …
This study aims to improve communication between fragmented blockchain systems in finance.
problem Inefficient and insecure communication in fragmented blockchain systems.
method Analysis of cross-chain interoperability protocols and their properties.
result Comparison and evaluation of cross-chain interoperability protocols.
New Y-systems for Miquel dynamics are Möbius invariant.
problem Miquel dynamics circle centers are not Möbius invariant.
method Introduced new Y-systems involving only intersection points.
result New Y-systems are Möbius invariant and satisfy the transformation group principle.
Kernel sparsity ("dying ReLUs") and lack of diversity are commonly observed in CNN kernels, which decreases model capacity. Drawing inspiration from information theory and wireless communications, we demonstrate the intersection of coding theory and deep learning through the Grassmannian subspace packing problem in CNN…
The paper examines how closed curves on surfaces intersect and how this intersection determines the curves.
problem Determining closed curves on surfaces based on their intersections.
method Constructing and studying k-equivalent curves, analyzing intersections with other curves. result Curves are determined by their intersections with all other curves, but non-simple curves require infinitely many intersections to distinguish.
3-manifold triangulation can be reconstructed from its intersection matrix.
problem Reconstructing the triangulation of 3-manifolds from their intersection matrix.
method Using the intersection matrix of a simplicial complex to determine the triangulation of a 3-manifold up to isomorphism.
result The intersection matrix is sufficient to determine the triangulation of a 3-manifold up to isomorphism.
The paper finds diffeomorphic complex intersections with distinct Hodge numbers.
problem Identifying complex intersections with different Hodge numbers.
method Provided three pairs of 3-dimensional and one pair of 5-dimensional complex complete intersections, all diffeomorphic but with different Hodge numbers.
result Diffeomorphic complex intersections can have different Hodge numbers.
New polynomials defined for virtual knots, calculated up to crossing 4.
problem Defining and calculating invariants for virtual knots.
method Intersection number of curves on a closed surface.
result Intersection polynomials calculated up to crossing 4.
In this paper we present the algorithms for calculating the differential geometric properties {t,n,b1,b2,b3,k1,k2,k3,k4} along-with geodesic curvature and geodesic torsion of the transversal intersection curve of four hypersurfaces (given by parametric representation) in Euclidean space R^5. In transversal intersection…
We generalize the PL intersection product for chains on PL manifolds and for intersection chains on PL stratified pseudomanifolds to products of locally finite chains on non-compact spaces that are natural with respect to restriction to open sets. This is necessary to sheafify the intersection product, an essential ste…
Conditions for curves on a torus with specific pairwise intersections.
problem Finding curves on a torus with prescribed pairwise intersections.
method Necessary and sufficient conditions for curves on a torus with given pairwise intersections.
result Necessary and sufficient conditions for the existence of curves on a torus with specific pairwise intersections.
Study self-intersections of arcs on a pair of pants, proving natural number spectrum.
problem Understanding self-intersections of arcs on a pair of pants.
method Algorithm to compute self-intersection number, bounds established in terms of word length.
result Spectrum of self-intersection numbers covers all natural numbers.
Virtual knots with same writhe polynomial have equivalent intersection graphs.
problem Equivalence of intersection graphs for virtual knots.
method Proved equivalence through writhe polynomial.
result Intersection graphs of virtual knots with the same writhe polynomial are equivalent.
Study properties of self-similar continua with finite intersection property.
problem Characterize self-similar continua with finite intersection property.
method Prove intersection graph criterion, finite order theorem, and parameter matching theorem.
result All Jordan arcs starting from a intersection point in such continuum on a plane should have the same slope parameter at that point.
Estimates intersection pairing in hyperbolic 4-manifolds.
problem Estimating intersection pairing in hyperbolic 4-manifolds.
method Using Thurston norms of homology classes.
result Proved an estimate on intersection pairing.
By considering a (not necessarily locally-flat) PL knot as the singular locus of a PL stratified pseudomanifold, we can use intersection homology theory to define intersection Alexander polynomials, a generalization of the classical Alexander polynomial invariants for smooth or PL locally-flat knots. We show that the i…
Classifies arcs on a 4-punctured sphere that intersect at most once.
problem Classifying arcs on a 4-punctured sphere with intersection constraints.
method Classification of maximal systems of arcs intersecting at most once.
result Maximal systems of arcs on the 4-punctured sphere identified.
James McClure recently showed that the domain for the intersection pairing of PL chains on a PL manifold M is a subcomplex of C∗(M)⊗C∗(M) that is quasi-isomorphic to C∗(M)⊗C∗(M) and, more generally, that the intersection pairing endows C∗(M) with the structure of a partially-defined commutati…
Novel approach for large genus intersection number asymptotics.
problem Computing intersection numbers in large genus.
method Resurgent analysis of n-point functions with quantum curve.
result Extension of Aggarwal's results and new r-spin and Theta-class intersection numbers. The paper calculates self-intersections on a pair of pants using Bowen and Series' coding.
problem Computing the number of self-intersections of closed geodesics on a pair of pants.
method Used Bowen and Series' coding to compute self-intersections.
result Proved a conjecture and provided bounds for self-intersection numbers.
Generic potential primes have no self-intersections or intersections.
problem Finding non-degenerate periodic orbits without self-intersections.
method Generic convex Hamiltonian approach and Mañé genericity.
result Prime periodic orbits do not intersect or have self-intersections.
Paper proves curves can be smoothed to reduce self-intersection by exactly 1.
problem Prove that the shortest closed geodesic self-intersects exactly k times.
method Carefully smoothing intersection points reduces self-intersection by exactly 1.
result The shortest closed geodesic self-intersects exactly k times for hyperbolic and Riemannian metrics.
The paper extends intersection theory for b-divisors, proving monotonicity and volume inequalities.
problem Intersection theory for b-divisors and monotonicity of intersection products.
method Developed general intersection theory of nef b-divisors, defined restricted volume, proved monotonicity.
result Proved quantitative monotonicity of intersection product and new volume inequalities.
Study intersection polynomials of long virtual knots with supporting genera.
problem Characterize long virtual knots using geometric invariants.
method Define and analyze 1- and 2-supporting genera, and use them to filter long virtual knots. result Provide complete realizability criteria for all twelve intersection polynomials.
Paper computes Atiyah class for DG manifolds of amplitude +1.
problem Computing the Atiyah class for DG manifolds of specific amplitude.
method Computed the Atiyah class by encoding the derived intersection of sections and zero sections of vector bundles.
result Atiyah class vanishes if and only if the intersection is clean.
Minimum algebraic intersection found in hyperbolic surfaces, growing with genus.
problem Finding the minimum algebraic intersection form in hyperbolic surfaces.
method Analyzing algebraic intersection form in moduli space of hyperbolic surfaces.
result Minimum grows in the order of (logg)−2 with genus. We continue here the investigation of the relationship between the intersection of a pair of subgroups of a Kleinian group, and in particular the limit set of that intersection, and the intersection of the limit sets of the subgroups. Of specific interest is the extent to which the intersection of the limit sets being …
In this paper we study relations between intersection numbers on moduli spaces of curves and Hurwitz numbers. First, we prove two formulas expressing Hurwitz numbers of (generalized) polynomials via intersections on moduli spaces of curves. Then we show, how intersection numbers can be expressed via Hurwitz numbers. An…
This paper presents a novel framework for accurate pedestrian intent prediction at intersections. Given some prior knowledge of the curbside geometry, the presented framework can accurately predict pedestrian trajectories, even in new intersections that it has not been trained on. This is achieved by making use of the …
Study the intersection of positive closed currents using tangent currents and King's residue formula.
problem Investigate the intersection of positive closed currents in complex manifolds.
method Employ tangent currents and King's residue formula to establish a natural condition for intersection.
result Derive an integral representation of the intersection of positive closed currents.
Unified quantum invariants via intersections of embedded Lagrangians.
problem Unified quantum invariants for Uq(sl(2)). method State sum of Lagrangian intersections in configuration spaces.
result Recovery of coloured Jones and Alexander polynomials.
Positivity of intersections in 4-manifolds leads to taming symplectic structures.
problem Taming symplectic structures in almost complex 4-manifolds.
method Proof of positivity of intersections of pseudoholomorphic curves.
result Positivity of intersections is stable and leads to taming symplectic structures.
Given a hyperbolic surface §, a classic result of Birman and Series states that for each K, all complete geodesics with at most K self-intersections can only pass through a certain nowhere dense, Hausdorff dimension 1 subset of §. We define a self-intersection function for each complete geodesic, which bounds t…
The paper explores intersectional fairness in machine learning, proving bounds on it.
problem Intersectional fairness in machine learning, especially when multiple protected attributes are involved.
method Statistical analysis and bounds on intersectional fairness, leveraging marginal fairness.
result Theoretical bounds on intersectional fairness can be computed from marginal fairness and other statistical quantities.
Based on Nielsen fixed point theory and Gröbner-Shirshov basis, we obtain a simple method to compute geometric intersection numbers and self-intersection geometric numbers of loops on surfaces.
Proves a conjecture about Lagrangian intersections using new theory.
problem Homological Arnol'd conjecture on Lagrangian intersections.
method New Lagrangian Ljusternik-Schnirelman theory and fundamental quantum factorizations.
result Uniform lower bounds on Lagrangian intersection numbers.
The paper proves the exact number of singular points in the intersection of convex shapes.
problem Determining the exact number of singular points in the intersection of convex shapes.
method Analyzing the intersections of n translates of a strictly convex, smooth, convex body in the Euclidean plane.
result The intersection of n translates of a convex body has exactly n points of singularity along its boundary.