New methods connect low-loss points on neural network surfaces.
problem Connecting low-loss points on neural network loss surfaces.
method Macroscopic distributional assumptions and global connection models.
result Accuracy correlates with complexity and sensitivity.
Improved method for numerical conformal mappings on complex domains.
problem Accurate and efficient computation of conformal mappings on multiply connected domains.
method Generalization and refinement of the conjugate function method using high-order finite element methods.
result Achieved accurate and efficient construction of boundary values for multiply connected domains.
Method counts connected 2D stratifolds with singular curves and components.
problem Counting 1-connected trivalent 2-stratifolds. method Describes a method for counting.
result Counts 1-connected trivalent 2-stratifolds. New method proves Jones Polynomial's connect sum property.
problem Jones Polynomial's behavior under connect sums.
method Trip matrix method for calculating Jones Polynomial.
result Jones Polynomial is multiplicative under connect sums.
Direct method finds Yang-Mills connections for SO(3) bundles.
problem Finding Yang-Mills connections for SO(3) bundles over closed 4-manifolds.
method Direct minimizing method with test connections and assumptions.
result Minimizing sequence converges to a minimizer or anti-selfdual/selfdual connection.
LOCUS separates brain network connectivity matrices efficiently.
problem High dimensionality, latent sources, and spurious findings in analyzing brain connectivity matrices.
method LOCUS: low-rank structure with uniform sparsity, iterative Node-Rotation algorithm.
result LOCUS achieves more efficient and accurate source separation for connectivity matrices.
The paper proves hyperbolic groups are semistable and their boundaries are linearly connected.
problem Local connectivity of hyperbolic group boundaries
method Elementary proofs based on Bestvina-Mess's original ideas
result All hyperbolic groups are semistable at infinity and their boundaries are linearly connected.
New method for linear connections in ODEs with constraints.
problem Constructing linear connections for ODEs with and without constraints.
method Novel method using submodule covariant derivatives.
result Closed form expressions for Massa-Pagani connection and its extension.
Defines annulus complex of handlebodies and proves its connectivity.
problem None explicitly stated; focus on definition and proof.
method Combinatorial methods to prove connectivity.
result Connectivity of annulus complex of handlebodies proven.
Method estimates network connectivity and dimensionality from multiple networks.
problem Estimating connectivity and dimensionality in samples of networks.
method Convex optimization with alternating direction method of multipliers.
result Method outperforms conventional methods in estimating connectivity and dimensionality.
We define what we call morphisms of Cartan connections. We generalize the main theorems on Cartan connections to theorems on morphisms. Many of the known constructions involving Cartan connections turn out to be examples of morphisms. We prove some basic results concerning completeness of Cartan connections. We provide…
The paper characterizes simply connected quandles using cocycles with prime values.
problem Characterizing simply connected quandles.
method Using cocycles with values in abelian groups of prime size.
result Classification of simply connected quandles of sizes p2 and p3 for p>3. We construct a canonically defined affine connection in sub-Riemannian contact geometry. Our method mimics that of the Levi-Civita connection in Riemannian geometry. We compare it with the Tanaka-Webster connection in the three-dimensional case.
The paper explores connections between braids, links, and cobordisms using algebraic methods.
problem Investigating functions on manifolds and their connections to braids, links, and cobordisms.
method Algebraic methods including group theory, sheaves, and formal groups.
result Constructs Lazard's one-dimensional universal commutative formal group and applies it to cobordism theory.
Estimation of reliable whole-brain connectivity is a crucial step towards the use of connectivity information in quantitative approaches to the study of neuropsychiatric disorders. When estimating brain connectivity a challenge is imposed by the paucity of time samples and the large dimensionality of the measurements. …
Proposes a method to enhance graph models by injecting unseen connections.
problem Enhancing graph models to utilize unseen connections.
method Parametric link injection layer to find and inject weak connections.
result Improves performance on node classification and link prediction tasks.
Clarifies connections between Nyström and SVGP methods for scalable GPs.
problem Lack of understanding between GP and kernel methods communities.
method Investigates Nyström and SVGP methods for scalable Gaussian processes.
result Establishes connections and equivalences between Nyström and SVGP methods.
Skip connections make adversarial examples more transferable in ResNets.
problem Transferability of adversarial examples in ResNets with skip connections.
method Skip Gradient Method (SGM) to craft more transferable adversarial examples.
result SGM improves transferability of adversarial examples in various DNNs.
The past few years have witnessed the fast development of different regularization methods for deep learning models such as fully-connected deep neural networks (DNNs) and Convolutional Neural Networks (CNNs). Most of previous methods mainly consider to drop features from input data and hidden layers, such as Dropout, …
Reduces constructing multiplicative connections to simpler tasks.
problem Constructing multiplicative connections on proper Lie groupoids.
method Reduction to simpler tasks involving proper and regular Lie groupoids.
result Simpler methods for constructing multiplicative connections.
Proves rotational symmetry for Serrin-type problems in doubly connected domains.
problem Proving symmetry in Serrin-type problems for doubly connected domains.
method Employing the technique from arXiv:2109.11255 and comparing with the classical moving plane method.
result Rotational symmetry results for Serrin-type problems in doubly connected domains.
Method flattens complex surfaces with consistent density and shape.
problem Shape deformations and local geometric distortions in density-equalizing maps for multiply-connected surfaces.
method Formulates density diffusion as a quasiconformal flow, solving an energy minimization problem involving the Beltrami coefficient to ensure bijectivity and control distortion.
result Achieves optimal parameterization of multiply-connected surfaces with bijective and controlled geometric distortions.
Method proves connection stability of vector fields on noncompact manifolds.
problem Stability of vector fields on noncompact manifolds.
method Developed a method to prove connection stability, showing equivalence to structural stability on compact manifolds.
result Presented an example of a connection stable vector field on a noncompact manifold and showed that harmonic oscillator is not connection stable.
Motivated by numerical integration on manifolds, we relate the algebraic properties of invariant connections to their geometric properties. Using this perspective, we generalize some classical results of Cartan and Nomizu to invariant connections on algebroids. This has fundamental consequences for the theory of numeri…
Study finds PLI functional connectivity feature superior for depression recognition.
problem Effective detection of depression remains a public health challenge.
method Resting state EEG data collected from MDD and normal controls; various feature types and selection methods evaluated.
result PLI functional connectivity feature superior to linear and nonlinear features; highest classification accuracy 82.31%.
Two novel algorithms for conformal parameterization of multiply-connected surfaces.
problem Parameterization of surfaces with holes.
method Developed efficient methods using quasi-conformal theory.
result Efficient conformal parameterization of multiply-connected surfaces.
We present a hybrid method for latent information discovery on the data sets containing both text content and connection structure based on constrained low rank approximation. The new method jointly optimizes the Nonnegative Matrix Factorization (NMF) objective function for text clustering and the Symmetric NMF (SymNMF…
Paper connects risk consistency to L_p consistency for broader loss functions.
problem Establishing risk consistency for a wider class of loss functions.
method Analyzes the connection between risk consistency and L_p-consistency for various loss functions.
result Shifted loss functions do not reduce assumptions as much as other results.
Learning-based link scheduling improves network performance in millimeter-wave multi-connectivity.
problem Efficient link scheduling is crucial for maximizing network performance in millimeter-wave multi-connectivity.
method A learning-based approach to predict optimal link scheduling.
result The learning-based solution outperforms base line methods and approaches the optimal solution.
Paper finds non-positive Weyl connections on Lie groups, confirming a conjecture.
problem Finding non-positive invariant Weyl connections on Lie groups.
method Investigation of completely solvable Lie groups, focusing on SOL group.
result Only SOL admits non-positive Weyl connections, confirming a conjecture.
We proved a uniqueness theorem of tangent connections for a Yang-Mills connection with an isolated singularity with a quadratic growth of the curvature at the singularity. We also obtained controls over the rate of the asymptotic convergence of the connection to the tangent connection under assumptions that the connect…
SpINNEr uses matrix regression to analyze brain connectivity, improving accuracy over other methods.
problem Analyzing multi-dimensional data like brain imaging arrays using traditional scalar regression methods.
method SpINNEr applies matrix regression with nuclear norm and lasso norms to encourage low rank and sparse solutions.
result SpINNEr outperforms other methods in estimating brain connectivity, especially in well-connected regions.
This paper is a review of the twistor theory of irreducible G-structures and affine connections. Long ago, Berger presented a very restricted list of possible irreducibly acting holonomies of torsion-free affine connections. His list was complete in the part of metric connections, while the situation with holonomies of…
DCGANs generate drainage networks quickly from samples.
problem High computational costs in generating large numbers of drainage networks.
method DCGANs trained with connectivity-informed directional information.
result Connectivity-informed DCGANs outperform other methods in reproducing accurate drainage networks.
The paper extends affine connection results to singular warped and twisted products.
problem Generalizing affine connections to singular warped and twisted products.
method Study of singular multiply warped products and singular twisted products with semi-symmetric metric and non-metric connections, discussing Koszul forms and curvature.
result Theoretical results on curvature and Koszul forms for singular multiply warped and twisted products.
eDCF estimates intrinsic dimension using local connectivity.
problem Challenges in estimating intrinsic dimension due to scale dependence.
method eDCF: a novel, scalable, and parallelizable method based on Connectivity Factor (CF).
result eDCF consistently matches leading estimators with comparable MAE and higher exact intrinsic dimension match rates.
In this paper, a frequency coefficient based on the Sen-Shorrocks-Thon (SST) poverty index notion is proposed. The clustering SST index can be used as the method for determination of the connection between similar neighbor sub-clusters. Consequently, connections can reveal existence of natural homogeneous. Through esti…
It is well-known that a torsion-free linear connection on a light-like manifold (M,g) compatible with the degenerate metric g exists if and only if Rad(TM) is a Killing distribution. In case of existence, there is an infinitude of connections with none distinguished. We propose a method to single out connections …
Improved graph-based connectivity estimation using heat modelling.
problem Lack of explicit model-based, dynamic, multivariate, and directed connectivity estimation methods.
method Noise-driven heat modelling on graphs with relaxed assumptions and regularisation.
result Demonstrated ability to capture meaningful spatial structure across real-world datasets.
We propose a novel denoising framework for task functional Magnetic Resonance Imaging (tfMRI) data to delineate the high-resolution spatial pattern of the brain functional connectivity via dictionary learning and sparse coding (DLSC). In order to address the limitations of the unsupervised DLSC-based fMRI studies, we u…
A method of simultaneously optimizing both the structure of neural networks and the connection weights in a single training loop can reduce the enormous computational cost of neural architecture search. We focus on the probabilistic model-based dynamic neural network structure optimization that considers the probabilit…
In this paper, we discuss some aspects of the averaging method for Poisson connections on foliated manifolds with symmetry generalizing the previous results on the Hannay-Berry connections on fibrations due to \cite{Mn-88,MaMoRa-90} which play an important role in the normal form theory for Hamiltonian systems of adiab…
Development of stock networks is an important approach to explore the relationship between different stocks in the era of big-data. Although a number of methods have been designed to construct the stock correlation networks, it is still a challenge to balance the selection of prominent correlations and connectivity of …
We construct several natural connections and Dirac type operators on a general metric contact manifold which are more sensitive to the geometric background. In the special case of CR manifolds these connections are also compatible with the CR structure and include among them the Webster connection. We also describe sev…
Improved matching for multiple objects using a novel reweighting method.
problem Current multi-object matching methods have limitations and are not robust.
method Proposes a novel iterative reweighting strategy using the graph connection Laplacian.
result Demonstrates superior performance over state-of-the-art methods.
A new method for faster optimization on statistical manifolds.
problem Slow convergence of first-order methods in manifold optimization.
method Dual Riemannian Newton method on manifolds with dual connections.
result Local quadratic convergence of the dual Riemannian Newton method.
The paper studies conformal and projective structures using 2-frame bundles.
problem Understanding connections between conformal and projective structures.
method Using the dressing field method to obtain local, gauge invariant connections.
result A projective tractor bundle can be defined using the same construction as for conformal structures.
We introduce a method in differential geometry to study the derivative operators of Siegel modular forms. By determining the coefficients of the invariant Levi-Civita connection on a Siegel upper half plane, and further by calculating the expressions of the differential forms under this connection, we get a non-holomor…