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

1.3%2.7%4.0%5.4% · Oct 201919922001200920172026
48 results for event-based communication

Event-based learning reduces communication in distributed networks.

problem Distributed learning with diverse data distributions and communication inefficiencies.
method A distributed learning algorithm using ADMM with event-triggered communication.
result The algorithm converges even with distinct local data distributions and achieves accelerated convergence in convex settings.

SparseProp speeds up SNN simulations and training by four orders of magnitude.

problem Efficiently simulating and training large spiking neural networks.
method Event-based algorithm that reduces computational cost from O(N) to O(log(N)) per spike.
result Numerically exact simulations of large spiking networks and efficient training using backpropagation.

New approach uses deep reinforcement learning for vehicle dispatching, reducing waiting times.

problem Dynamic vehicle dispatching problem in various contexts.
method Event-based semi-Markov decision process with deep q-learning.
result Deep reinforcement learning policies outperform heuristic methods in New York City data.

Study examines APOE's impact on AD progression using a novel DEBM approach.

problem Understanding APOE's role in AD progression and developing targeted clinical trials.
method Developed a discriminative event-based model (DEBM) and proposed a stratified approach to improve model accuracy.
result Identified APOE carriers' impact on AD progression timeline, aiding clinical trial selection.

Bayesian BIC for multi-trial data improves VAR model order selection.

problem Optimal VAR model order selection for multi-trial event-based data.
method Derive and apply Bayesian Information Criterion (BIC) for multi-trial ensemble data.
result Multi-trial BIC successfully recovers real model order and estimates small model order.

Efficiently models event-based data with general parametric kernels.

problem Inference for Hawkes processes with general parametric kernels requires large datasets.
method Developed a fast 2\ell_2 gradient-based solver using a discretized version of events.
result Improved estimation of pattern latency in brain signals.

This paper investigates the influence of different acoustic features, audio-events based features and automatic speech translation based lexical features in complex emotion recognition such as curiosity. Pretrained networks, namely, AudioSet Net, VoxCeleb Net and Deep Speech Net trained extensively for different speech…

2018-10-31abs ↗pdf ↗

This paper introduces intrinsic time, a new measure of time for complex systems.

problem Traditional time measures fail to capture the dynamic nature of real-world phenomena.
method Intrinsic time uses an event-based, algorithmic framework to analyze time series data.
result Intrinsic time reveals novel structures and regularities in financial markets.

GRUwE improves irregular time series prediction with simpler, efficient RNN-based approach.

problem Irregularly sampled multivariate time series prediction challenges.
method Gated Recurrent Unit with Exponential basis functions (GRUwE).
result GRUwE achieves competitive or superior performance compared to recent state-of-the-art methods.

In digital advertising, Click-Through Rate (CTR) and Conversion Rate (CVR) are very important metrics for evaluating ad performance. As a result, ad event prediction systems are vital and widely used for sponsored search and display advertising as well as Real-Time Bidding (RTB). In this work, we introduce an enhanced …

2019-07-03abs ↗pdf ↗

We introduce an event based framework of directional changes and overshoots to map continuous financial data into the so-called Intrinsic Network - a state based discretisation of intrinsically dissected time series. Defining a method for state contraction of Intrinsic Network, we show that it has a consistent hierarch…

2014-02-10abs ↗pdf ↗

This study reviews decentralized prediction markets, identifying key design variants and open problems.

problem Designing and implementing decentralized prediction markets with desirable properties.
method Modular workflow comprising eight stages: infrastructure, market topic, share structure, pricing, market initialization, trading, resolution, settlement, and archiving. Analysis of design variants and trade-offs.
result Identification of open problems for researchers in the field of decentralized prediction markets.

Technology offers new ways to measure the locations of the players and of the ball in sports. This translates to the trajectories the ball takes on the field as a result of the tactics the team applies. The challenge professionals in soccer are facing is to take the reverse path: given the trajectories of the ball is i…

2015-08-10abs ↗pdf ↗

Improved ANN-based Monte Carlo simulation for Higgs decay events.

problem Accurate simulation of Higgs boson decay events.
method Monte Carlo simulation using an Artificial Neural Network (ANN) with improved training algorithm.
result The ANN simulation of Higgs decay is within 0.7% of the true value and achieves 26% unweighting efficiency.

Configuring deep Spiking Neural Networks (SNNs) is an exciting research avenue for low power spike event based computation. However, the spike generation function is non-differentiable and therefore not directly compatible with the standard error backpropagation algorithm. In this paper, we introduce a new general back…

2018-09-05abs ↗pdf ↗

Monitoring of disasters is crucial for mitigating their effects on the environment and human population, and can be facilitated by the use of unmanned aerial vehicles (UAV), equipped with camera sensors that produce aerial photos of the areas of interest. A modern technique for recognition of events based on aerial pho…

2018-07-31abs ↗pdf ↗

News is a pertinent source of information on financial risks and stress factors, which nevertheless is challenging to harness due to the sparse and unstructured nature of natural text. We propose an approach based on distributional semantics and deep learning with neural networks to model and link text to a scarce set …

2015-07-25abs ↗pdf ↗

Analyzes intrinsic time in financial markets, linking it to physical time.

problem Understanding the intrinsic nature of time in financial data.
method Presented an analytic relationship linking intrinsic and physical time, using empirical scaling laws.
result A novel empirical scaling law relating intrinsic time variability to overshoots.

A new method for CT-DCEGs simplifies inference for asymmetric processes.

problem Inference in asymmetric state space problems with continuous time evolution.
method An extension of CEG propagation for CT-DCEGs, employing junction tree inference.
result CT-DCEGs are preferred over DBNs and continuous time BNs for asymmetric processes.

Paper proposes a new reinforcement learning framework for cryptocurrency market making.

problem Improving profit and stability in cryptocurrency market making.
method Event-based reinforcement learning environment, training two policy-based agents with neural networks and various reward functions.
result Improved profit and stability demonstrated over time-based approach.

A new framework maximizes influence spread in social networks by accounting for inter-community diffusion.

problem Real-world social networks have inter-community influence that is often overlooked in community-based IM approaches.
method Community-IM++ uses a heuristic based on community-based diffusion degree and progressive budgeting to model and prioritize cross-community diffusion.
result Community-IM++ achieves near-greedy influence spread at up to 100 times lower runtime than existing methods.

We introduce the concept of community trees that summarizes topological structures within a network. A community tree is a tree structure representing clique communities from the clique percolation method (CPM). The community tree also generates a persistent diagram. Community trees and persistent diagrams reveal topol…

2017-10-11abs ↗pdf ↗

We introduce a new paradigm that is important for community detection in the realm of network analysis. Networks contain a set of strong, dominant communities, which interfere with the detection of weak, natural community structure. When most of the members of the weak communities also belong to stronger communities, t…

2017-02-24abs ↗pdf ↗

Study exact community detection in k-community Gaussian mixtures with different intensities.

problem Community detection in k-community Gaussian mixtures with varying intensities.
method Explicitly find the threshold for exact recovery of maximum likelihood estimation.
result Threshold for exact recovery of maximum likelihood estimation is identified.

Paper addresses data heterogeneity in federated learning for CoxPH models in healthcare.

problem Data heterogeneity in federated learning of CoxPH models for healthcare.
method Feature-based clustering and event-based reporting strategy.
result Enhanced model accuracy and performance in federated survival analysis.

The paper introduces a method for detecting principal communities and embedding vertices.

problem Detecting and embedding vertices in graphs with community structure.
method Principal graph encoder embedding method that detects principal communities and produces vertex embeddings.
result The method successfully detects principal communities and produces accurate vertex embeddings.

Improved distributed learning with reduced communication costs.

problem Efficient communication in resource-constrained environments for distributed learning.
method Proposed a cost-effective partial communication protocol.
result Communication cost is reduced to O(logT)O(\log T), improving significantly on full communication.

Statistical estimates can often be improved by fusion of data from several different sources. One example is so-called ensemble methods which have been successfully applied in areas such as machine learning for classification and clustering. In this paper, we present an ensemble method to improve community detection by…

2013-09-01abs ↗pdf ↗

MACC learns communication protocols by adapting counterfactual reasoning.

problem Credit assignment and non-stationarity in communication environments.
method Adapts counterfactual reasoning to overcome credit assignment and uses action policy and Q-function of other agents to handle non-stationarity.
result MACC outperforms state-of-the-art baselines in four scenarios.

A novel framework for adaptive multi-agent communication in reinforcement learning.

problem Manual specification of communication structures in multi-agent reinforcement learning.
method Learning Structured Communication (LSC) framework using hierarchical graph neural networks.
result Adaptive hierarchical formations and efficient message propagation among agents.

A framework for multi-agent communication over noisy channels in reinforcement learning.

problem Effective communication between multiple agents in a noisy environment.
method A novel multi-agent partially observable Markov decision process (MA-POMDP) framework considering noisy communication channels.
result Jointly learned policies outperform separate learning of communication and decision making.