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

Trend · papers per month

9.2%18.4%27.7%36.9% · May 201919922001200920172026
48 results for giant networks

Graph neural networks tackle representation learning for small and giant graphs.

problem Learning representations from small and giant graphs.
method Various graph neural network models tailored for small and giant graphs.
result Graph neural networks achieve state-of-the-art performance on node and graph classification tasks.

This paper uses unlabeled data to improve compressed neural networks.

problem Difficulty in retraining pre-trained models due to limited labeled data.
method Uses unlabeled data to mimic classification characteristics and aligns feature distributions using adversarial loss.
result Unlabeled data significantly improves the performance of compressed neural networks.

SPT predicts age and mass of red giants from spectra.

problem Challenges in age and mass estimation of red giants using traditional methods.
method SPT framework with Multi-head Hadamard Self-Attention and Mahalanobis distance-based loss function.
result Remarkable age and mass estimations with low errors and uncertainties.

This study uses deep learning to infer stellar parameters from short TESS and K2 observations.

problem Inferring precise stellar parameters from short-duration TESS and K2 observations.
method Developed a machine learning algorithm to infer asteroseismic parameters from one-month-long TESS observations of red giants.
result The algorithm can accurately infer ΔνΔν and νmaxν_{\mathrm{max}} for approximately 50% of TESS samples and ΔΠ1ΔΠ_{1} for about 200 young red-giants from K2.

GShard enables scaling of large neural networks with automatic sharding and lightweight APIs.

problem Scaling neural networks to handle vast training data and compute efficiently.
method GShard uses lightweight annotation APIs and XLA compiler extensions for parallel computation.
result GShard successfully trained a 600 billion parameter model on 2048 TPUs in 4 days.

If we pick nn random points uniformly in [0,1]d[0,1]^d and connect each point to its kk-nearest neighbors, then it is well known that there exists a giant connected component with high probability. We prove that in [0,1]d[0,1]^d it suffices to connect every point to cd,1loglogn c_{d,1} \log{\log{n}} points chosen randomly among its $…

2017-11-13abs ↗pdf ↗

The structure of the control network of transnational corporations affects global market competition and financial stability. So far, only small national samples were studied and there was no appropriate methodology to assess control globally. We present the first investigation of the architecture of the international …

2011-07-28abs ↗pdf ↗

Synthetic reference strings are as effective as real ones for training citation parsing models.

problem Lack of training data for citation parsing, especially with deep neural networks.
method Trained Grobid with human-labelled and synthetically created reference strings, and evaluated retraining and out-of-sample data impact.
result Synthetic and real reference strings are equally effective for training Grobid, with retraining improving performance.

New AI approach improves quantum device calibration by leveraging prior scientific discoveries.

problem Lack of abundant data in scientific disciplines hinders model generalizability.
method Introduces a new machine learning approach that combines prior scientific knowledge with data.
result Accuracy in predicting quantum device energy spectrum surpasses current state-of-the-art by over 20%.

Study reveals trade dynamics in dry bulk shipping networks, highlighting their randomness and periodic changes.

problem Understanding the randomness and periodic changes in dry bulk shipping networks.
method Analysis of micro-level trade flow data from 2015 to 2023, focusing on grain, coal, and iron ore networks.
result Dry bulk shipping networks exhibit small-world phenomena and periodic life cycles, influenced by importing ports and global events.

We provide an empirical investigation aimed at uncovering the statistical properties of intricate stock trading networks based on the order flow data of a highly liquid stock (Shenzhen Development Bank) listed on Shenzhen Stock Exchange during the whole year of 2003. By reconstructing the limit order book, we can extra…

2010-03-12abs ↗pdf ↗

The state-of-the-art machine learning approaches are based on classical von Neumann computing architectures and have been widely used in many industrial and academic domains. With the recent development of quantum computing, researchers and tech-giants have attempted new quantum circuits for machine learning tasks. How…

2019-06-30abs ↗pdf ↗

Results of the application of pattern recognition techniques to the problem of identifying Giant Radio Sources (GRS) from the data in the NVSS catalog are presented and issues affecting the process are explored. Decision-tree pattern recognition software was applied to training set source pairs developed from known NVS…

2016-03-22abs ↗pdf ↗

Method reconstructs financial networks from aggregate data, revealing critical link density.

problem Reconstructing financial networks from aggregate data is challenging due to unreconstructability phases.
method Random graph generation with desired link density and replicated constraints.
result There is a critical link density below which networks become unreconstructable.

We propose a fast second-order method that can be used as a drop-in replacement for current deep learning solvers. Compared to stochastic gradient descent (SGD), it only requires two additional forward-mode automatic differentiation operations per iteration, which has a computational cost comparable to two standard for…

2018-05-21abs ↗pdf ↗

We present a simple model of firm rating evolution. We consider two sources of defaults: individual dynamics of economic development and Potts-like interactions between firms. We show that such a defined model leads to phase transition, which results in collective defaults. The existence of the collective phase depends…

2009-04-28abs ↗pdf ↗

We compare correlations and coherent structures in nuclei and financial markets. In the nuclear physics part we review giant resonances which can be interpreted as a coherent structure embedded in chaos. With similar methods we investigate the financial empirical correlation matrix of the DAX and Dow Jones. We will sho…

2009-10-22abs ↗pdf ↗

New GAN design uses conditional independence graphs to improve model-based GANs.

problem Designing model-based GANs using additional information about underlying distribution.
method Study subadditivity properties of probability divergences to design model-based GANs.
result Model-based GANs using neighborhood discriminators provide significant statistical and computational benefits.

This is the first of three papers that refine and extend portions of our earlier preprint, "Depth of a knot tunnel." Together, they rework the entire preprint. H. Goda, M. Scharlemann, and A. Thompson described a general construction of all tunnels of all tunnel number 1 knots using "tunnel moves". We apply the theory …

2008-12-07abs ↗pdf ↗

Current deep learning architectures are growing larger in order to learn from complex datasets. These architectures require giant matrix multiplication operations to train millions of parameters. Conversely, there is another growing trend to bring deep learning to low-power, embedded devices. The matrix operations, ass…

2016-02-26abs ↗pdf ↗

We consider the problem of separating error messages generated in large distributed data center networks into error events. In such networks, each error event leads to a stream of messages generated by hardware and software components affected by the event. These messages are stored in a giant message log. We consider …

2018-04-10abs ↗pdf ↗

Study financial contagion and risk in sparse networks with directed edges.

problem Analyzing systemic risk in sparse financial networks with balance-sheet interactions.
method Linear fraction of institutions with zero out-degree, sender-truncated subgraph G_sh, adversarial and random systemic events, explicit fan-in accumulation bound.
result Maximal forward reachability in G_sh is O(log n) with high probability in the subcritical regime, and multi-hit defaults are negligible in the supercritical regime.

Sharp thresholds and contiguity for community detection in contextual SBM.

problem Community detection in graphs with high-dimensional node-covariates.
method Contextual Stochastic Block Model, non-rigorous cavity method, information theory.
result Established the sharp threshold for detection and weak recovery in the contextual SBM.

Two-layer neural networks learn features through a few gradient descent steps, improving approximation capacity.

problem Improving approximation capacity of two-layer neural networks.
method Theoretical investigation of a two-layer neural network's adaptation to target function through a few gradient descent steps.
result Learning multiple target directions requires a larger batch size and more gradient steps, improving approximation capacity.

We study the spectral gap of the Erdős--Rényi random graph through the connectivity threshold. In particular, we show that for any fixed δ>0δ> 0 if p(1/2+δ)lognn,p \ge \frac{(1/2 + δ) \log n}{n}, then the normalized graph Laplacian of an Erdős--Rényi graph has all of its nonzero eigenvalues tightly concentrated around 11. We est…

2012-01-02abs ↗pdf ↗

Our analysis of financial data, in terms of super-exponential growth, suggests that the seed of the 2002/03 crisis of the Dutch supermarket giant AHOLD was planted in 1996. It became quite visible in 1999 when the post-bubble destabilization regime was well-developed and acted as the precursor of an inevitable collapse…

2004-03-22abs ↗pdf ↗

COMRADE is a communication-efficient, Byzantine-resilient second-order optimization algorithm.

problem Byzantine failures in distributed optimization.
method COMRADE is a communication-efficient, second-order optimization algorithm that uses a simple norm-based thresholding rule to filter out Byzantine workers.
result COMRADE achieves linear-quadratic convergence and is robust against Byzantine workers.