The paper studies deformations of cohesive modules on complex manifolds.
problem Deformation theory of cohesive modules on compact complex manifolds.
method Development of Kuranishi maps and obstructions for deformations of cohesive modules.
result Generalization of deformation theory for holomorphic vector bundles and coherent sheaves.
We formulate differential cohomology and Chern-Weil theory -- the theory of connections on fiber bundles and of gauge fields -- abstractly in the context of a certain class of higher toposes that we call "cohesive". Cocycles in this differential cohomology classify higher principal bundles equipped with cohesive struct…
The paper develops residue currents for cohesive modules and proves a generalized Poincaré-Lelong formula.
problem Analyzing coherent sheaves on complex manifolds using global analytic methods.
method Developing residue currents for cohesive modules and proving their properties.
result Proves a generalized Poincaré-Lelong formula for cohesive modules.
Study examines how business units can benefit from group cohesion under regulatory constraints.
problem Regulatory constraints limit business units' ability to form a single cohesive group.
method Defined and analyzed cohesive risk measures to minimize capital costs.
result Cohesive risk measures allow groups to achieve minimal capital costs without altering individual liabilities.
A new method improves graph node embeddings by considering both nearby and distant node similarities.
problem Improving graph node embeddings by considering both nearby and distant node similarities.
method Distance-aware Negative Sampling (DNS) which maximizes cohesion at nearby node-pairs and separation at distant node-pairs.
result DNS outperforms baseline methods in downstream node classification tasks on various datasets and GRL algorithms.
Policy-gradient method controls multiple non-cohesive targets.
problem Controlling multiple non-cohesive targets in a decentralized manner.
method Proximal Policy Optimization for target selection and driving.
result Effective control of non-cohesive targets without prior dynamics knowledge.
Motivated by recent financial crises significant research efforts have been put into studying contagion effects and herding behaviour in financial markets. Much less has been said about influence of financial news on financial markets. We propose a novel measure of collective behaviour in financial news on the Web, New…
Unified classification of equivariant principal bundles using higher homotopy theory.
problem Unified classification of equivariant principal bundles.
method Smooth Oka principle, singular-cohesive homotopy theory, internally describing principal bundles.
result Unified classification results for equivariant principal bundles.
The paper generalizes current constructions to cohesive modules and characteristic forms.
problem Constructing currents for characteristic forms of cohesive modules.
method Generalized construction of pseudomeromorphic currents for de-Rham characteristic classes and characteristic forms of cohesive modules.
result Currents representing characteristic forms can be constructed using the degree-0 and degree-1 parts of the superconnection.
LOCO-Reg improves CNN accuracy by promoting feature cohesion near filter centers.
problem Current regularization schemes in CNNs violate the principle that weights near the center of a filter are larger than weights on the outside.
method Introduces Locality-Promoting Regularization (LOCO-Reg) to correct this issue.
result LOCO-Reg yields accuracy gains across multiple architectures and datasets.
Method predicts which high-dimensional correlation signs will change in the future.
problem Predicting which correlation matrix coefficients will change signs in high-dimensional data.
method Stability of correlation signs depends on three-by-three relationships, inspired by Heider social cohesion theory.
result The method accurately predicts the stability of correlation signs in high-dimensional data.
Using the concept of a cohesive module defined by Block, we use the theory of superconnections in the sense of Quillen to construct natural superconnections on Hermitian cohesive modules. By the Chern-Weil construction, we obtain characteristic classes with values in Bott-Chern cohomology which refines the usual deRham…
Proposes a method for multi-layered network embeddings that improves performance.
problem Mapping multi-layered network nodes into a vector space while preserving relationships.
method Jointly embed nodes in all layers via DeepWalk on a supra graph, then fine-tune embeddings for cohesive structure.
result Outperforms existing single- and multi-layered network embedding algorithms on benchmarks.
Cohesion uses deep Koopman operators to generate long-range forecasts of chaotic dynamics.
problem Challenges in data-driven emulation of chaotic dynamics, especially long-range skill decay.
method Generative modeling with coherent priors estimated using reduced-order models.
result Superior long-range forecasting skill on chaotic systems, including climate dynamics.
Cyclification of orbifolds explained in cohesive higher topos theory.
problem Understanding cyclification of orbifolds in geometric and algebraic contexts.
method Cohesive higher topos theory and transgression of cohomological charges.
result Cyclification of orbifolds is a fundamental base-change construction.
Higher gauge theory via differential nonabelian cohomology
problem Global infrared completion of higher gauge fields
method Maxwell-type higher gauge fields
result Electromagnetic flux quantization
Enhances kernel regression with network data for better predictions.
problem Improving predictive power in high-dimensional data.
method Combines kernel regression with network cohesion data to model nonlinearities.
result Significantly better predictive performances in high-dimensional data.
Intuitive clustering algorithm balances cluster size and cohesion.
problem Cluster definition and selection in data analysis.
method Nearest neighbours equilibrium condition for clustering.
result High-quality clustering solutions compared to benchmarks.
Online PaLD extends PaLD for semi-supervised online applications.
problem Scalability of unsupervised clustering algorithms for large datasets.
method Adapted partitioned local depth algorithm for online semi-supervised prediction.
result Online PaLD extends cohesion network to new data points efficiently.
Discriminative clustering uses mutual information to cluster data.
problem Clustering data into cohesive groups.
method Discriminative clustering using mutual information.
result Mutual information has been a cornerstone of discriminative clustering.
New bounds improve linkage methods for clustering, distinguishing complete-link from single-link.
problem Improving bounds on linkage methods for clustering quality.
method Developed new bounds for complete-link and average-link methods in agglomeration clustering.
result Separated complete-link from single-link in terms of approximation for diameter.
Introduces a new geometric framework for non-perturbative BV-theory.
problem Non-perturbative generalization of BV-theory in infinite-dimensional spaces.
method Derived differential geometry and homotopical algebraic geometry.
result Concrete model of derived smooth stacks for encoding non-perturbative BV-theory.
Data mining reveals power structures in Bangladeshi newspapers.
problem Understanding the power dynamics and narrative structure in news reporting.
method Named entity recognition to create temporal actor networks from news statements.
result Cliquishness among powerful political leaders in news articles.
The paper explains the importance of diffeological groupoids in modern geometry and physics.
problem None explicitly stated, focuses on the concept and applications.
method Expository review of the development and applications of diffeological groupoids.
result The diffeological groupoid serves as a powerful tool in various areas of modern geometry and physics.
This is a survey of motivations, constructions and applications of higher prequantum geometry. In section 1 we highlight the open problem of prequantizing local field theory in a local and gauge invariant way, and we survey how a solution to this problem exists in higher differential geometry. In section 2 we survey ex…
Develops a new method for network-linked data using Gaussian graphical models.
problem Graphical models for network-linked data violate independence and identically distributed assumptions.
method Proposes a Gaussian graphical model for network-linked data with varying mean vectors and smooth transitions over the network. Efficient estimation algorithm developed.
result Demonstrates effectiveness on simulated and real data, obtaining meaningful results on a statistics coauthorship network.
HCRL learns hierarchical embeddings from deep embeddings of hierarchy components.
problem Flat clustering limits cohesive instance relations in hierarchical data.
method Simultaneously optimizes representation learning and hierarchical clustering in the embedding space.
result HCRL achieves best hierarchical clustering and data reconstruction.
This paper argues that the fundamental principle of contemporary financial economics is balanced reciprocity, not the principle of utility maximisation that is important in economics more generally. The argument is developed by analysing the mathematical Fundamental Theory of Asset Pricing with reference to the emergen…
Cluster analysis is used to explore structure in unlabeled data sets in a wide range of applications. An important part of cluster analysis is validating the quality of computationally obtained clusters. A large number of different internal indices have been developed for validation in the offline setting. However, thi…
RobPy offers robust statistical methods in Python.
problem Lack of robust statistical methods in Python.
method Built on NumPy, SciPy, and scikit-learn, RobPy includes robust tools for various statistical tasks.
result RobPy enables more users to perform robust data analysis in Python.
Examines multiagent systems for complex learning tasks.
problem Achieving cohesive learning behavior in multiagent networks.
method General formulation for multiagent dynamics and conditions for learning.
result Conditions for achieving cohesive learning behavior in multiagent networks.
Neuroimage analysis usually involves learning thousands or even millions of variables using only a limited number of samples. In this regard, sparse models, e.g. the lasso, are applied to select the optimal features and achieve high diagnosis accuracy. The lasso, however, usually results in independent unstable feature…
Proposes CoDEAL for estimating heterogeneous treatment effects in panel data models.
problem Estimating heterogeneous treatment effects in causal panel data models with covariate effects.
method Covariate-Adjusted Deep Causal Learning (CoDEAL) integrating neural networks and autoencoders.
result Establishes theoretical guarantees and demonstrates compelling performance in simulations and real data.
Extends partitioned local depth concept with probabilistic considerations.
problem Uncertain, variable, and conflicting information in data.
method Partitioned local depth with probabilistic concepts of local relevance and support division.
result Extends original ideas to handle uncertain data.
In online social media systems users are not only posting, consuming, and resharing content, but also creating new and destroying existing connections in the underlying social network. While each of these two types of dynamics has individually been studied in the past, much less is known about the connection between th…
This paper shows cross-entropy can recover latent structures in supervised learning.
problem Understanding why supervised learning works well and how models learn interpretable factors of variation.
method Extending identifiability results to parametric instance discrimination, proving cross-entropy minimization can recover latent structures up to linear transformations.
result Models trained with cross-entropy can learn representations of ground-truth factors of variation up to a linear transformation.
Automated framework generates mechanical models via deep reinforcement learning.
problem Deriving theoretical-consistent, micro-structural-based traction-separation laws.
method Meta-modeling framework using deep reinforcement learning to form graph edges and maximize model score.
result Automated model generation outperforms existing cohesive models and detects hidden mechanisms.
Stock price movement reveals complex interdependencies that are simplified through linear correlation.
problem Exploring the spectral dynamics of the Indonesian capital market using structural network representations.
method Combining three dependency estimators (Pearson, MI adaptive binning, and MI-kNN) with two graph filtering schemes (MST and PMFG) and four community decoders.
result MI adaptive binning is shown to be more proportional than kNN for detecting residual information.
Enhances LDL by integrating distance and directional information for more robust label feature representation.
problem Lack of robust label feature representation in LDL tasks, especially with label ambiguity.
method Introduces Structural Anchor Points (SAPs) to capture inter-cluster interactions and a novel LSFs construction strategy, LIFT-SAP.
result Improves LDL performance by 15% on average across 15 real-world datasets.
Synthetic theory defines orbifolds as microlinear types with finite identifications.
problem Defining orbifolds in traditional set-level foundations with internal symmetries.
method Synthetic differential cohesive homotopy type theory, microlinearity, finite identifications.
result Proper étale groupoids are orbifolds in synthetic theory.
The paper explores how to fairly share longevity risk among participants of tontine schemes.
problem Fair distribution of longevity risk among participants with varying wealth and health.
method Develops a modeling framework for sharing benefits among survivors in tontine schemes.
result There are multiple ways to share longevity risk, depending on social cohesion.
SNJ recovers latent tree models from similarity matrices.
problem Reconstructing latent tree models from observed data.
method Spectral Neighbor Joining (SNJ) method.
result SNJ is consistent and requires fewer samples for accurate tree recovery.
survex explains machine learning survival models, improving model transparency.
problem Lack of tools to explain machine learning survival models.
method Introduces survex R package using explainable AI techniques.
result Improves model reliability and detects biases in survival models.
Survival analysis models predict economic convergence across Americas.
problem Analyzing GDP per capita trajectories and convergence across the Americas.
method Survival analysis, machine learning, economic interpretation.
result DeepSurv captures non-linear interactions in GDP per capita trajectories.
Model shows how social norms and individual ethics affect tax evasion.
problem Effects of social norms and individual ethics on tax evasion.
method Agent-based model with simulations of different tax compliance behaviors.
result Threshold levels in society composition explain tax evasion extent.
RoME optimizes mobile health interventions by modeling user and time-specific effects.
problem Challenges in optimizing mobile health interventions due to participant heterogeneity, nonstationarity, and nonlinear relationships.
method RoME uses a Robust Mixed-Effects contextual bandit algorithm with random effects, network cohesion penalties, and debiased machine learning.
result RoME achieves robust regret bounds even with complex baseline rewards, demonstrating superior performance in simulations and studies.
A new method classifies multiple correlated data streams simultaneously.
problem Classifying multiple correlated data streams in practical scenarios.
method Double-Coupling Support Vector Machines (DC-SVM) considers both internal and external correlations.
result The proposed method outperforms traditional methods on artificial and real-world data streams.
New models automate support group formation in online health communities.
problem Challenges in traditional support group formation methods for scalability, static categorization, and insufficient personalization.
method Two novel machine learning models: gDMR and gSTM, integrating user content, demographics, and network data.
result Models outperform baselines in predictive accuracy, semantic coherence, and internal group consistency.