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

3877115153 · Jun 202019922001200920172026
48 results for Temporal aggregation

GTEA learns node representations in temporal interaction graphs.

problem Inductive representation learning on temporal interaction graphs.
method Integrates sequence model with time encoder and self-attention scheme for edge and node embeddings.
result GTEA learns comprehensive node representations capturing temporal and structural characteristics.

Aggregation distorts causal discovery results but recovery is possible with partial linearity or prior.

problem Understanding how temporal aggregation affects causal discovery in aggregated data.
method Functional consistency and conditional independence consistency methods.
result Causal discovery results may be distorted by aggregation, but recovery is possible with certain conditions.

Temporal aggregation reveals latent default correlation from monthly data.

problem Understanding effective default correlation from monthly default data.
method Temporal coarse-graining of latent default-probability paths.
result Temporal coarse-graining improves identifiability and reduces over-allocation of long-horizon fluctuations.

The study introduces measures of collective mobility from aggregated OD data.

problem Understanding large-scale mobility patterns from aggregated data.
method Developed a framework using synthetic and real data to interpret network-level mobility.
result Aggregated mobility measures reveal network structure and flow constraints.

Temporal coarse-graining of latent default paths explains effective correlation in corporate defaults.

problem Understanding effective default correlation in corporate defaults.
method Temporal coarse-graining of latent default-probability paths, applied to corporate default-count data.
result Temporal coarse-graining provides a scale-consistent baseline that improves identifiability and reduces over-allocation of long-horizon fluctuations.

CT-OT Flow estimates continuous-time dynamics from discrete snapshots.

problem Estimating continuous-time dynamics from temporally aggregated snapshots with noisy or uncertain timestamps.
method Two-stage framework: aligning neighboring intervals via partial optimal transport (POT) and reconstructing a continuous-time distribution through temporal kernel smoothing.
result Reduces distributional and trajectory errors compared with existing methods across synthetic and real datasets.

We present an approach to estimate the severity of traffic related accidents in aggregated (area-level) and disaggregated (point level) data. Exploring spatial features, we measure complexity of road networks using several area level variables. Also using temporal and other situational features from open data for New Y…

2019-06-25abs ↗pdf ↗

tempdisagg transforms low-frequency data into high-frequency estimates.

problem Transforming low-frequency data into high-frequency estimates.
method Uses econometric techniques including Chow-Lin, Denton, Litterman, Fernandez, and uniform interpolation.
result Transforms low-frequency aggregates into consistent, high-frequency estimates.

Study uses echo-sounder buoys to analyze tuna schools' association with dFADs globally.

problem Understanding temporal trends of tuna schools' association to drifting objects.
method Applied Machine Learning to examine binary and regression outputs of tuna schools' colonization and disaggregation times.
result Median colonization and disaggregation times varied by ocean, with Pacific having longest soak and colonization times.

pFedGame uses game theory for decentralized federated learning in dynamic networks.

problem Performance bottlenecks, data bias, model convergence issues, and model poisoning attacks in federated learning.
method pFedGame employs game theory to decentralize federated learning, avoiding a central aggregation server and addressing dynamic network challenges.
result pFedGame achieves higher accuracy (over 70%) in heterogeneous data compared to existing methods.

Multidimensional data have become ubiquitous and are frequently encountered in situations where the information is aggregated over multiple data atoms. The aggregation can be over time or other features, such as geographical location. We often have access to multiple aggregated views of the same data, each aggregated i…

2019-10-26abs ↗pdf ↗

This paper presents a way of solving Markov Decision Processes that combines state abstraction and temporal abstraction. Specifically, we combine state aggregation with the options framework and demonstrate that they work well together and indeed it is only after one combines the two that the full benefit of each is re…

2015-01-16abs ↗pdf ↗

Inductive representation learning on temporal graphs is an important step toward salable machine learning on real-world dynamic networks. The evolving nature of temporal dynamic graphs requires handling new nodes as well as capturing temporal patterns. The node embeddings, which are now functions of time, should repres…

2020-02-19abs ↗pdf ↗

Recovering edge activities from node activity data in temporal networks.

problem Recovering lost edge activity data from aggregated node activity data in temporal networks.
method Analyzing the relationship between edge activity and node activity data, using both theoretical and empirical methods to show recovery is possible and under what conditions.
result Recovery of edge activities from node activities is possible with surprising accuracy, even when network density increases.

Temporal coarse-graining of multi-sector default count data generates effective correlation matrices and rank copulas.

problem Explaining the difference in default dependence between monthly and annual aggregation.
method Dynamic low-rank state-space model with AR(1) latent credit-state factors.
result Effective correlation matrices and rank copulas are generated from monthly default count data.

A method for fast, accurate cross-temporal forecasts using machine learning.

problem Inconsistent forecasts across different levels of platform data.
method Non-linear hierarchical forecast reconciliation using machine learning.
result Automated direct production of reconciled forecasts for high-frequency decision making.

FLUXtrapolation benchmarks machine learning for extrapolating ecosystem fluxes under distribution shifts.

problem Machine learning challenges in extrapolating ecosystem fluxes under distribution shifts.
method Defined temporal, spatial, and temperature-based extrapolation scenarios; evaluated performance across domains, temporal aggregations, and tail errors.
result Baselines perform similarly under median hourly RMSE but differ under tail-focused and multi-scale evaluations.

New method detects and locates changes in spatio-temporal point processes.

problem Detecting and localizing changes in spatio-temporal data.
method Score-based, likelihood-free approach estimating change time and region.
result The method provides theoretical guarantees on detection and localization accuracy.

Study develops curvature for contact-sequence networks, revealing temporal dynamics.

problem Lack of geometric analysis for temporal network sequences.
method Develops Forman--Ricci curvature on spatiotemporal prism complexes.
result Two curvature variants disagree on 56-67% of temporal edges.

CDA framework infers channel influence from aggregated data without user identifiers.

problem Lack of user-level path data due to privacy regulations and platform restrictions.
method CDA integrates PCMCI for causal discovery and Structural Causal Model for effect estimation.
result CDA achieves strong accuracy in estimating channel influence, even under structural uncertainty.

Machine learning struggles with temporal data in finance, leading to inaccurate models.

problem Machine learning models struggle with temporal data in finance, leading to inaccurate predictions.
method Review and critique current machine learning approaches for temporal data in finance.
result Current approaches to machine learning in finance often ignore the temporal richness of data.

This paper challenges the current metrics used for evaluating long-term forecasting models.

problem Current metrics focus on pointwise error reduction, ignoring structural properties.
method Proposes a multi-dimensional evaluation approach that includes statistical fidelity, structural coherence, and decision-level relevance.
result Current progress in forecasting may reflect specialization in benchmark configurations rather than deeper understanding of temporal dynamics.

This study examines how financial tick data becomes more random with time aggregation.

problem Investigating the randomness of financial tick data over time.
method Applied statistical randomness tests from NIST and TestU01 batteries to ultra-high frequency financial data.
result Financial tick data becomes increasingly random as the aggregation level of transaction time increases.

Estimating temporal patterns in travel times along road segments in urban settings is of central importance to traffic engineers and city planners. In this work, we propose a methodology to leverage coarse-grained and aggregated travel time data to estimate the street-level travel times of a given metropolitan area. Ou…

2020-01-13abs ↗pdf ↗

Meta-learning framework for credit risk assessment of SMEs, aligning financial statement dates with evaluation dates.

problem Temporal misalignment of credit scoring models leading to bias and inconsistent predictions.
method Two-step temporal decomposition: static model for annual PDs, dynamic model for monthly PDs; stacking architecture to aggregate multiple models.
result Framework effectively captures credit risk evolution over time, improving temporal consistency and predictive stability.