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

Trend · papers per month

1122 · Jun 201919922001200920172026
25 results for multi-node

This paper tackles CRL for multi-node interventions, achieving identifiability guarantees.

problem CRL under unknown multi-node interventions, focusing on single-node assumptions.
method Establishes identifiability results for general latent causal models under stochastic interventions.
result Identifiability up to ancestors using soft interventions, perfect identifiability using hard interventions.

Paper tackles cybersecurity attack detection with an ensemble approach.

problem Challenges in multi-class classification for cyber security breaches.
method Designing a multi-node multi-class classification ensemble approach.
result Proposed approach outperforms full-data approach in multi-node data-censoring cases.

New method identifies causal variables from multi-node interventions, expanding on previous single-node approaches.

problem Inferring high-level causal variables from low-level observations under multiple interventions.
method Exploits variance trace of ground truth causal variables and regularizes for sparsity.
result First identifiability result for causal representation learning with multiple node interventions.

Paper applies RL to optimize inventory management across multiple products and nodes.

problem Optimizing inventory management for a large number of products with shared capacity in a multi-node supply chain.
method Novel multi-agent hierarchical reinforcement learning framework with A2C algorithm and quantised action spaces.
result The approach optimizes for maximizing product sales and minimizing wastage of perishable products.

We propose a novel technique for faster deep neural network training which systematically applies sample-based approximation to the constituent tensor operations, i.e., matrix multiplications and convolutions. We introduce new sampling techniques, study their theoretical properties, and prove that they provide the same…

2018-05-21abs ↗pdf ↗

Exchanging gradients is a widely used method in modern multi-node machine learning system (e.g., distributed training, collaborative learning). For a long time, people believed that gradients are safe to share: i.e., the training data will not be leaked by gradient exchange. However, we show that it is possible to obta…

2019-06-21abs ↗pdf ↗

The scale of functional magnetic resonance image data is rapidly increasing as large multi-subject datasets are becoming widely available and high-resolution scanners are adopted. The inherent low-dimensionality of the information in this data has led neuroscientists to consider factor analysis methods to extract and a…

2016-08-16abs ↗pdf ↗

The paper shows how to learn causal representations with few environments and finite samples.

problem Learning causal representations from limited data and environments.
method Explicit, finite-sample guarantees with a logarithmic number of interventions.
result Consistent recovery of latent causal graph, mixing matrix, and unknown intervention targets.

We present POLO --- a C++ library for large-scale parallel optimization research that emphasizes ease-of-use, flexibility and efficiency in algorithm design. It uses multiple inheritance and template programming to decompose algorithms into essential policies and facilitate code reuse. With its clear separation between…

2018-10-08abs ↗pdf ↗

New method identifies stable latent variables across different domains using weak distributional invariances.

problem Learning causal representations for multi-domain datasets.
method Autoencoders incorporating weak distributional invariances.
result Autoencoders can identify stable latent variables across different domains.

Deep learning (DL) is one of the most prominent branches of machine learning. Due to the immense computational cost of DL workloads, industry and academia have developed DL libraries with highly-specialized kernels for each workload/architecture, leading to numerous, complex code-bases that strive for performance, yet …

2019-06-15abs ↗pdf ↗

Embedding words in a vector space has gained a lot of attention in recent years. While state-of-the-art methods provide efficient computation of word similarities via a low-dimensional matrix embedding, their motivation is often left unclear. In this paper, we argue that word embedding can be naturally viewed as a rank…

2015-06-09abs ↗pdf ↗

HR-calculus enables adaptive processing of quaternion signals.

problem Lack of adaptive processing techniques for quaternion-valued signals.
method Introduction and development of HR-calculus for quaternion algebra.
result Derivation of gradient operator, chain and product derivative rules, and Taylor series expansion for quaternion calculus.

The analysis of scientific data of increasing size and complexity requires statistical machine learning methods that are both interpretable and predictive. Union of Intersections (UoI), a recently developed framework, is a two-step approach that separates model selection and model estimation. A linear regression algori…

2018-08-21abs ↗pdf ↗

Bayesian approach learns causal concepts from diverse social surveys.

problem Inferring causal concepts from heterogeneous data with sparse changes.
method Hierarchical Bayesian model with sequential Monte Carlo sampling.
result Model infers meaningful causal concepts and plausible relations.

Study identifies a Strategic Gap in market efficiency due to AI-driven timing and complexity in disclosure.

problem Market inefficiency due to structural influence of disclosure timing and complexity.
method Introduces Autonomous Disclosure Regulator, a multi-node AI framework to audit disclosure complexity and unpredictability.
result Companies use confusing language and unpredictable timing to slow down market learning, creating a 60% Structural Gap.

This work sets a universal lower bound for learning causal DAGs with atomic interventions.

problem Learning causal DAGs using only observational data results in a Markov equivalence class, requiring interventions to fully orient.
method Developed CBSP orderings and used them to prove a universal lower bound on the number of single-node interventions needed.
result The universal lower bound is within a factor of two of the minimum number of single-node interventions required to fully orient a given Markov equivalence class.

Dense Associative Memories outperform classical networks in robustness and signal processing.

problem Improving neural network performance in adversarial attacks and weak signal processing.
method Relaxing replica symmetry in statistical mechanics of spin glasses to analyze unsupervised and supervised learning.
result Explicit analytical investigation of phase diagrams and storage capacities for Dense Associative Memories.

New method for disentangling latent factors with sparse dependencies.

problem Disentangling latent factors from observed variables and past factors.
method Mechanism sparsity regularization and sparse causal graphical model.
result Identifiability of latent factors up to a sparse causal graph.