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.
A decentralized routing framework for lunar exploration robots.
LUNAR uses cellular automata for real-time data classification in fast streams.
This is a brief survey of the research performed by Grandata Labs in collaboration with numerous academic groups around the world on the topic of human mobility. A driving theme in these projects is to use and improve Data Science techniques to understand mobility, as it can be observed through the lens of mobile phone…
This paper improves QoS metric prediction in DTNs using diffusion models.
Online random forests improve Q-learning performance in specific gym environments.
We present ErasureHead, a new approach for distributed gradient descent (GD) that mitigates system delays by employing approximate gradient coding. Gradient coded distributed GD uses redundancy to exactly recover the gradient at each iteration from a subset of compute nodes. ErasureHead instead uses approximate gradien…
Meta-learning curiosity algorithms improves exploration across various tasks.
We develop and analyze an asynchronous algorithm for distributed convex optimization when the objective writes a sum of smooth functions, local to each worker, and a non-smooth function. Unlike many existing methods, our distributed algorithm is adjustable to various levels of communication cost, delays, machines compu…
This paper compares model-based and model-free control methods using neural networks.
We propose Deep Q-Networks (DQN) with model-based exploration, an algorithm combining both model-free and model-based approaches that explores better and learns environments with sparse rewards more efficiently. DQN is a general-purpose, model-free algorithm and has been proven to perform well in a variety of tasks inc…
In artificial intelligence, we often specify tasks through a reward function. While this works well in some settings, many tasks are hard to specify this way. In deep reinforcement learning, for example, directly specifying a reward as a function of a high-dimensional observation is challenging. Instead, we present an …
Robots learn to navigate rough terrain using reinforcement learning.
Bayesian inference models failure distributions in autonomous systems.
This paper presents a novel formulation and solution of orbit determination over finite time horizons as a learning problem. We present an approach to orbit determination under very broad conditions that are satisfied for n-body problems. These weak conditions allow us to perform orbit determination with noisy and high…
Given a stationary state-space model that relates a sequence of hidden states and corresponding measurements or observations, Bayesian filtering provides a principled statistical framework for inferring the posterior distribution of the current state given all measurements up to the present time. For example, the Apoll…
Helps visually impaired users make better decisions by adjusting their observations.
RFN improves GCNs for road networks, outperforming state-of-the-art by 21%-40%.
This survey clarifies dynamic network terminology and reviews GNN models for dynamic networks.
From the perspective of network analysis, the ubiquitous networks are comprised of regular and irregular components, which makes uncovering the complexity of network structures to be a fundamental challenge. Exploring the regular information and identifying the roles of microscopic elements in network data can help us …
Chemical networks outperform spiking neural networks in classification tasks.
Deep ReLU networks can be simplified to a three-layer model.
This paper explores loss landscapes of sparse neural networks, finding unique characteristics compared to dense networks.
New approach learns latent motifs in networks for mesoscale structure analysis.
A challenging problem in complex networks is the network reconstruction problem from data. This work deals with a class of networks denoted as conserved networks, in which a flow associated with every edge and the flows are conserved at all non-source and non-sink nodes. We propose a novel polynomial time algorithm to …
Social network analysis is an important problem in data mining. A fundamental step for analyzing social networks is to encode network data into low-dimensional representations, i.e., network embeddings, so that the network topology structure and other attribute information can be effectively preserved. Network represen…
Taking inspiration from biological evolution, we explore the idea of "Can deep neural networks evolve naturally over successive generations into highly efficient deep neural networks?" by introducing the notion of synthesizing new highly efficient, yet powerful deep neural networks over successive generations via an ev…
SyNGLER generates synthetic networks efficiently while preserving key structural properties.
Secret neural networks hidden within trained models.
Natural graph networks are a new class of graph neural networks that are more flexible and scalable.
The structure of complex networks has been of interest in many scientific and engineering disciplines over the decades. A number of studies in the field have been focused on finding the common properties among different kinds of networks such as heavy-tail degree distribution, small-worldness and modular structure and …
Convolutional networks outperform fully-connected ones in certain tasks.
The interplay between inter-neuronal network topology and cognition has been studied deeply by connectomics researchers and network scientists, which is crucial towards understanding the remarkable efficacy of biological neural networks. Curiously, the deep learning revolution that revived neural networks has not paid …
Proposes a graph neural network for traffic forecasting in WANs.
Researchers derive exact priors for finite Bayesian neural networks.
i-cNRL learns network differences with interpretability.
Deep and wide networks are shown to be equivalent in terms of their capability.
We show that deep networks are better than shallow networks at approximating functions that can be expressed as a composition of functions described by a directed acyclic graph, because the deep networks can be designed to have the same compositional structure, while a shallow network cannot exploit this knowledge. Thu…
DCGANs generate drainage networks quickly from samples.
A network embedding consists of a vector representation for each node in the network. Its usefulness has been shown in many real-world application domains, such as social networks and web networks. Directed networks with text associated with each node, such as software package dependency networks, are commonplace. Howe…
Quantum neural network and tensor network models outperform classical models in Japanese stock market predictions.
Study deep maxout networks and their equivalence to Gaussian processes.
Machine learning improves network classification and model selection.
Study shows effective resistance distance yields more accurate network barycenter than Hamming distance.
Model-based neural networks generalize better than ReLU networks for sparse recovery.
A new method predicts links better across various networks.
Recent works reveal that network embedding techniques enable many machine learning models to handle diverse downstream tasks on graph structured data. However, as previous methods usually focus on learning embeddings for a single network, they can not learn representations transferable on multiple networks. Hence, it i…
This paper proposes network recasting as a general method for network architecture transformation. The primary goal of this method is to accelerate the inference process through the transformation, but there can be many other practical applications. The method is based on block-wise recasting; it recasts each source bl…
Road networks are a type of spatial network, where edges may be associated with qualitative information such as road type and speed limit. Unfortunately, such information is often incomplete; for instance, OpenStreetMap only has speed limits for 13% of all Danish road segments. This is problematic for analysis tasks th…