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

6341,2671,9012,534 · Jun 202019922001200920172026
48 results for hubs and spokes

A distributed SGD method for heterogeneous networks with hubs and workers.

problem Learning in heterogeneous multi-level networks with worker heterogeneity and varying communication.
method Multi-Level Local SGD: distributed SGD with hub-and-spoke paradigm and hub averaging.
result The method converges with error dependent on worker heterogeneity, hub network topology, and iterations.

FedSplit improves federated learning by ensuring correct convergence to optimal solutions.

problem Federated learning's fixed points do not always correspond to optimal solutions in simple convex settings.
method FedSplit uses operator splitting procedures to solve distributed convex minimization problems with additive structure.
result FedSplit ensures that the fixed points correspond to optima of the original optimization problem.

This paper introduces scikit-hubness, a Python package for efficient nearest neighbor search in high-dimensional spaces. Hubness is an aspect of the curse of dimensionality, and is known to impair various learning tasks, including classification, clustering, and visualization. scikit-hubness provides algorithms for hub…

2019-12-02abs ↗pdf ↗

Paper introduces a new method to identify brain hubs using both structural and functional connectivity.

problem Hub node identification in brain networks using only functional connectivity.
method Graph signal processing framework that models functional activity as graph signals on structural connectivity.
result The proposed GraFHub framework identifies hub nodes more accurately than conventional methods.

This paper discusses the effect of hubness in zero-shot learning, when ridge regression is used to find a mapping between the example space to the label space. Contrary to the existing approach, which attempts to find a mapping from the example space to the label space, we show that mapping labels into the example spac…

2015-07-03abs ↗pdf ↗

This paper proposes a new method to learn combinatorial patterns for airline crew pairing optimization.

problem Enhancing airline crew pairing optimization for large-scale, complex flight networks.
method Variational Graph Auto-Encoder for learning combinatorial patterns among flight-connection graphs.
result The proposed method generates new pairings for the optimizer, improving the efficacy of airline crew pairing optimization.

GICDM corrects hubness in embedding spaces for better generative model evaluation.

problem Hubness phenomenon distorts distances in high-dimensional embedding spaces.
method Generative ICDM (GICDM) using multi-scale extension to correct neighborhood estimation.
result GICDM resolves hubness-induced failures and improves metric behavior.

Efficiently estimates hub graphical models with structured sparsity.

problem Computational difficulty in fitting graphical models with hub nodes, especially in high-dimensional data.
method Two-phase algorithm: ADMM for initial point generation and SSN-ALM for accurate solution.
result Significantly improves estimation accuracy and efficiency compared to existing methods.

We consider the problem of learning a high-dimensional graphical model in which certain hub nodes are highly-connected to many other nodes. Many authors have studied the use of an l1 penalty in order to learn a sparse graph in high-dimensional setting. However, the l1 penalty implicitly assumes that each edge is equall…

2014-02-28abs ↗pdf ↗

We consider the following general hidden hubs model: an n×nn \times n random matrix AA with a subset SS of kk special rows (hubs): entries in rows outside SS are generated from the probability distribution p0N(0,σ02)p_0 \sim N(0,σ_0^2); for each row in SS, some kk of its entries are generated from p1N(0,σ12)p_1 \sim N(0,σ_1^2), $…

2016-08-12abs ↗pdf ↗

BiLiNGAM model reveals brain emotion circuit development in adolescents.

problem Understanding brain emotion circuit development during adolescence.
method Bayesian incorporated linear non-Gaussian acyclic model (BiLiNGAM) for multiple DAGs estimation.
result BiLiNGAM reveals unique developmental hub structures and group-specific patterns in emotion-related intra- and inter-modular connectivity.

Speaker clustering is the task of differentiating speakers in a recording. In a way, the aim is to answer "who spoke when" in audio recordings. A common method used in industry is feature extraction directly from the recording thanks to MFCC features, and by using well-known techniques such as Gaussian Mixture Models (…

2018-03-22abs ↗pdf ↗

Study sample complexity of robust binary hypothesis testing under different contamination models.

problem Analyzing the sample complexity of robust binary hypothesis testing under various contamination models.
method Examined three standard contamination models: ε-additive (Huber), ε-subtractive, and ε-total variation (TV). Provided explicit formulas for least favourable distributions and compared sample complexities across models.
result Sample complexities are highly unstable in the contamination parameter ε and comparable up to constant-factor rescaling of ε across models.

New method identifies causal brain connections from fMRI data.

problem Identifying causal brain interactions from statistical associations.
method ψ-learning incorporated linear non-Gaussian acyclic model (ψψ-LiNGAM).
result Identified three types of hub structures and 16 causal flows.

The functioning of the cryptocurrency Bitcoin relies on the open availability of the entire history of its transactions. This makes it a particularly interesting socio-economic system to analyse from the point of view of network science. Here we analyse the evolution of the network of Bitcoin transactions between users…

2018-05-11abs ↗pdf ↗

New algorithm tackles multi-agent bandits with heavy-tailed data.

problem Maximizing system performance in multi-agent settings with heavy-tailed data.
method Algorithm exploits hub-like structures and synchronization among clients.
result Regret bound of O(M11αlogT)O(M^{1 -\frac{1}α} \log{T}) for homogeneous settings, O(MlogT)O(M \log{T}) for heterogeneous.

Recently, Graph Convolutional Networks (GCNs) and their variants have been receiving many research interests for learning graph-related tasks. While the GCNs have been successfully applied to this problem, some caveats inherited from classical deep learning still remain as open research topics in the context of the nod…

2019-11-07abs ↗pdf ↗

The paper proposes using low rank assumption to improve causal structure learning in DAGs.

problem Challenges in learning causal structures in high-dimensional, non-sparse DAGs.
method Exploits low rank assumption of DAG adjacency matrix to adapt causal structure learning methods.
result Maximum rank is highly related to hubs, suggesting low rank for scale-free networks.

Proposes a block-based model for attributed network embedding.

problem Handles both assortative and disassortative networks.
method Assigns nodes to blocks based on similar linkage patterns, using neural networks to preserve attribute information.
result Consistently outperforms state-of-the-art methods on disassortative networks.

Optimizes hydrokinetic turbine design using morphing and Bayesian optimization.

problem Designing optimal hydrokinetic turbine shapes due to high cost and geometric constraints.
method Design-by-Morphing (DbM) and Mixed variable, Multi-Objective Bayesian Optimization (MixMOBO).
result Optimized shapes lead to maximum power output with minimal evaluations.

The agent-based model of stock price dynamics on a directed evolving complex network is suggested and studied by direct simulation. The stationary regime is maintained as a result of the balance between the extremal dynamics, adaptivity of strategic variables and reconnection rules. The inherent structure of node agent…

2007-01-13abs ↗pdf ↗

Adversarially trained generative models (GANs) have recently achieved compelling image synthesis results. But despite early successes in using GANs for unsupervised representation learning, they have since been superseded by approaches based on self-supervision. In this work we show that progress in image generation qu…

2019-07-04abs ↗pdf ↗

Generative adversarial networks (GANs) are a class of deep generative models which aim to learn a target distribution in an unsupervised fashion. While they were successfully applied to many problems, training a GAN is a notoriously challenging task and requires a significant number of hyperparameter tuning, neural arc…

2018-07-12abs ↗pdf ↗

Functional connectivity refers to the temporal statistical relationship between spatially distinct brain regions and is usually inferred from the time series coherence/correlation in brain activity between regions of interest. In human functional brain networks, the network structure is often inferred from functional m…

2014-12-20abs ↗pdf ↗

Quantifying the importance and power of individual nodes depending on their position in socio-economic networks constitutes a problem across a variety of applications. Examples include the reach of individuals in (online) social networks, the importance of individual banks or loans in financial networks, the relevance …

2019-06-14abs ↗pdf ↗

Study shows negative stock returns after Moroccan companies issue profit warnings.

problem Impact of profit warnings on stock returns in Moroccan market.
method Event study methodology, analyzing Casablanca Stock Exchange, 2009-2016.
result Negative average abnormal return after profit warning announcements, greater for qualitative than quantitative warnings.

Learning the network structure underlying data is an important problem in machine learning. This paper introduces a novel prior to study the inference of scale-free networks, which are widely used to model social and biological networks. The prior not only favors a desirable global node degree distribution, but also ta…

2015-03-07abs ↗pdf ↗