Randomized graph construction ensures giant component with fewer edges.
problem Efficiently constructing sparse graphs with good connectivity.
method Randomly connecting points to a subset of their nearest neighbors.
result A sparser graph with comparable connectivity properties.
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.
Analyzes geodesic lengths in sparse networks, deriving a distribution.
problem Understanding connectivity and robustness in networked systems.
method Analytic derivation of geodesic length distribution in sparse networks.
result Simple closed-form expression for geodesic length distribution.
Geodesic X-ray transform proves injective for smooth one-forms on gas giant manifolds.
problem Injectivity of geodesic X-ray transform for one-forms on specific manifolds.
method Pestov identity and asymptotic analysis of short geodesics.
result Geodesic X-ray transform is solenoidally injective for smooth one-forms on gas giant manifolds.
GIANT optimizes distributed computing by improving Newton method efficiency.
problem Efficiently solving empirical risk minimization problems in distributed environments.
method GIANT combines local ANT directions to form a GIANT direction, averaging communications and computations.
result GIANT achieves faster convergence compared to first-order and existing Newton-type methods.
Study the geometry of gas giant planets to infer their internal structure.
problem Determine the interior structure of gas giant planets using boundary data.
method Geometric analysis of Riemannian manifolds with conformal blow-up at the boundary.
result The interior structure of a gas giant is uniquely determined by different types of boundary data.
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 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 for approximately 50% of TESS samples and ΔΠ1 for about 200 young red-giants from K2. 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…
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.
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.
This study reveals a walnut-shaped structure in the Japanese production network.
problem The validity and accuracy of conventional input-output analysis in Japanese production networks.
method Infomap method for community detection.
result Most irreducible communities are at the second level of the walnut structure.
We find a Sasaki-Einstein metric from a CFT state in AdS5.
problem Finding a Sasaki-Einstein metric from a CFT state.
method Using supergravity in AdS5 and a superconformal gauge theory in R3,1 in the t'Hooft limit. result Explicit finite N-approximations to the Sasaki-Einstein metric. We analyze higher-dimensional sliding puzzles, finding solvability patterns.
problem Solvability of higher-dimensional cubical sliding puzzles.
method Study of puzzle graphs and token movement constraints.
result Characterization of solvability regimes from stuck to fully solvable.
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 if p≥n(1/2+δ)logn, then the normalized graph Laplacian of an Erdős--Rényi graph has all of its nonzero eigenvalues tightly concentrated around 1. We est…
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%.
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.
Paper develops an attention mechanism for long-term scientific impact prediction.
problem Predicting the long-term impact of scientific papers based on citation records.
method Develops an attention mechanism to predict long-term scientific impact.
result Emphasizing the limited attention can better stand on the shoulders of giants.
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…
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.
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.
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.
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 …
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…
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…
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 …
Genomics has revolutionized biology, enabling the interrogation of whole transcriptomes, genome-wide binding sites for proteins, and many other molecular processes. However, individual genomic assays measure elements that interact in vivo as components of larger molecular machines. Understanding how these high-order in…
Machine learning predicts nuclear physics parameters with high accuracy.
problem Predicting nuclear physics parameters for superheavy elements.
method Gradient boosted trees algorithm trained on nuclear data.
result Predictions have standard deviation from 0.00035 to 0.73.
The paper tackles error event identification in network logs.
problem Identifying error events from network message logs.
method Transformed the problem into topic discovery in documents using a non-parametric change-point detection algorithm.
result The algorithm identifies error events from message logs efficiently and accurately.
This paper considers the use of Machine Learning (ML) in medicine by focusing on the main problem that this computational approach has been aimed at solving or at least minimizing: uncertainty. To this aim, we point out how uncertainty is so ingrained in medicine that it biases also the representation of clinical pheno…
ChatGPT predicts stock trends from Twitter sentiment, showing positive effects.
problem Predicting stock market trends using social media sentiment.
method Used ChatGPT for sentiment analysis of Twitter posts about Microsoft and Google.
result ChatGPT's predictions correlated positively with stock performance.
IRT metrics improve model evaluation by assessing latent characteristics.
problem Limitations of classic metrics like precision and F1.
method Introducing psychometric metrics like Item Response Theory (IRT).
result IRT complements classical metrics, offering new insights.
The sectoral synchronization observed for the Japanese business cycle in the Indices of Industrial Production data is an example of synchronization. The stability of this synchronization under a shock, e.g., fluctuation of supply or demand, is a matter of interest in physics and economics. We consider an economic syste…
In this work, we revisit fast dimension reduction approaches, as with random projections and random sampling. Our goal is to summarize the data to decrease computational costs and memory footprint of subsequent analysis. Such dimension reduction can be very efficient when the signals of interest have a strong structure…
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…
This work uses variational quantum circuits for deep reinforcement learning.
problem Intractability of deep quantum circuits on existing quantum computing platforms.
method Reshaping classical deep reinforcement learning algorithms into variational quantum circuits and using quantum information encoding.
result First proof-of-principle demonstration of variational quantum circuits for deep reinforcement learning.
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…
Survey examines ML for IoT security, addressing new challenges.
problem IoT security challenges due to rapid growth and diverse attacks.
method Comprehensive literature review of ML-based security solutions.
result ML provides dynamic and efficient security for IoT.
CurveBall is a fast deep learning solver that requires minimal computational resources.
problem Long-standing issues with current second-order solvers, especially computational cost and sensitivity to noise.
method Keeps a single estimate of the gradient projected by the inverse Hessian matrix, updated once per iteration, without maintaining an estimate of the Hessian.
result Faster convergence and no hyperparameter tuning on large models like ResNet and VGG-f networks.
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.
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.
Masanao Aoki developed a new methodology for a basic problem of economics: deducing rigorously the macroeconomic dynamics as emerging from the interactions of many individual agents. This includes deduction of the fractal / intermittent fluctuations of macroeconomic quantities from the granularity of the mezo-economic …
This working paper analyzes the gold price dynamics on the basis of methodology developed by Didier Sornette. Our calculations indicate that this dynamics is close to the one of the "bubbles" studied by Sornette and that the most probable timing of the "burst of the gold bubble" is April - June 2011. The obtained resul…
A dataset for detecting online hate speech from YouTube and Reddit comments.
problem Detecting and preventing hate speech on social media platforms.
method Created a dataset with two variants: binary and multi-label, based on YouTube and Reddit comments, using Figure-Eight crowdsourcing platform.
result Demonstrated that even a small amount of labelled data can help detect hate speech occurrences.
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.
Survey of deep learning methods for noisy labels in image classification.
problem Label noise in deep learning image classification.
method Noise model based and noise model free methods.
result Deep learning is robust to label noise but requires counter algorithms.
Study examines stock market connections before, during, and after the 2008 financial crisis.
problem Effects of the 2008 global financial crisis on stock market connectivity.
method Generated complex networks from cross-correlation matrices, using threshold networks and minimal spanning trees.
result During the crisis, countries in different zones had varying levels of connectivity.
OT theory optimizes moving sand piles to solve data science problems.
problem Optimizing the movement of data distributions.
method Comparing and transforming probability distributions to minimize cost.
result OT theory can be applied to various data science problems.