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

96192287383 · May 202619922001200920172026
48 results for Conditional Inter-dependence

New model captures time and mark inter-dependence in TPPs.

problem Limited predictive performance of conditionally independent TPP models on entangled time and mark interactions.
method Developed a multivariate TPP that models conditional inter-dependence of time and mark, using both intensity-based and intensity-free models.
result Proposed TPP models outperform conditionally independent and dependent models in standard prediction tasks.

This paper presents a new methodology for clustering multivariate time series leveraging optimal transport between copulas. Copulas are used to encode both (i) intra-dependence of a multivariate time series, and (ii) inter-dependence between two time series. Then, optimal copula transport allows us to define two distan…

2015-09-27abs ↗pdf ↗

This paper analyzes the dynamic incentives for technology adoption under a transferable permits system, which allows for strategic trading on the permit market. Initially, firms can invest both in low-emitting production technologies and trade permits. In the model, technology adoption and allowance price are generated…

2011-03-15abs ↗pdf ↗

This chapter provides an accessible introduction for point processes, and especially Hawkes processes, for modeling discrete, inter-dependent events over continuous time. We start by reviewing the definitions and the key concepts in point processes. We then introduce the Hawkes process, its event intensity function, as…

2017-08-21abs ↗pdf ↗

Graph neural networks improve equipment health monitoring from multisensor data.

problem Leveraging complex machinery structure for condition-based maintenance.
method Captured machinery structure as a graph and used graph neural networks (GNNs) to model time-series data.
result GNN-based RUL estimation model outperforms RNNs and CNNs on turbofan engine benchmark.

In this work, we move beyond the traditional complex-valued representations, introducing more expressive hypercomplex representations to model entities and relations for knowledge graph embeddings. More specifically, quaternion embeddings, hypercomplex-valued embeddings with three imaginary components, are utilized to …

2019-04-23abs ↗pdf ↗

Graphical models improve actuarial judgment in insurance claims analysis.

problem Improving actuarial judgment in insurance claims analysis.
method Using graphical models to represent complex inter-dependencies and incorporate qualitative knowledge.
result Graphical models can be used to express and analyze non-life insurance claims data.

New framework relaxes independence assumption for graph-mixing dependencies.

problem Tackles limitations of existing generalization results for graph-mixing dependencies.
method Proposes a framework where dependencies decay with graph distance, derives generalization bounds leveraging online-to-PAC framework.
result Derives high-probability generalization guarantees that depend on mixing rate and graph's chromatic number.

Estimates system parameters from a single observation using kernel-based score.

problem Estimating parameters of a dynamical system from a high-dimensional signal.
method Kernel-based score to compare temporal dependencies between signal and model.
result Accuracy and efficiency demonstrated on chaotic systems.

A new approach to learning in brain-like networks using adversarial algorithms.

problem Complex inter-dependencies in brain-like networks not compatible with conditional independence assumptions.
method Adversarial algorithm for learning models of perceptual processing.
result The approach can mimic known neural phenomena and yields testable hypotheses.

Deep neural networks learn by averaging fast variables, revealing a Gaussian process.

problem Analyzing the complex behavior of deep neural networks (DNNs) with billions of parameters.
method Identifying slow variables that average the erratic behavior of fast microscopic variables in fully trained DNNs.
result DNN layers couple only through the second moment (kernels) of their activations and pre-activations, which fluctuate in a nearly Gaussian manner.

Many real-world tasks such as classification of digital histopathology images and 3D object detection involve learning from a set of instances. In these cases, only a group of instances or a set, collectively, contains meaningful information and therefore only the sets have labels, and not individual data instances. In…

2019-11-18abs ↗pdf ↗

A novel graph spectral method for mixed categorical and numerical data.

problem Feature learning for mixed data types (numerical and categorical).
method Graph spectral decomposition of the graph Laplacian to model probabilistic dependence structure.
result Increased separability and clusterability of observations in the transformed feature space.

AGCRN forecasts traffic using adaptive graph and recurrent learning.

problem Forecasting traffic dynamics with complex spatial and temporal correlations.
method Adaptive Graph Convolutional Recurrent Network (AGCRN) with Node Adaptive Parameter Learning (NAPL) and Data Adaptive Graph Generation (DAGG).
result AGCRN outperforms state-of-the-art models without pre-defined graphs.

We develop a novel "decouple-recouple" dynamic predictive strategy and contribute to the literature on forecasting and economic decision making in a data-rich environment. Under this framework, clusters of predictors generate different latent states in the form of predictive densities that are later synthesized within …

2018-03-18abs ↗pdf ↗

Previous work has shown that popular trending events are important external factors which pose significant influence on user search behavior and also provided a way to computationally model this influence. However, their problem formulation was based on the strong assumption that each event poses its influence independ…

2019-03-01abs ↗pdf ↗

Congestion prediction represents a major priority for traffic management centres around the world to ensure timely incident response handling. The increasing amounts of generated traffic data have been used to train machine learning predictors for traffic, however this is a challenging task due to inter-dependencies of…

2019-07-15abs ↗pdf ↗

DSPO optimizes portfolio construction from raw stock data efficiently.

problem Manual design and misalignment in traditional portfolio construction methods.
method End-to-end neural network framework with Monotonical Logistic Regression loss.
result DSPO constructs optimal sorted portfolios with high performance metrics.

Network-based strategy for optimal cryptocurrency portfolios identified.

problem Challenges in predicting cryptocurrency prices in a volatile market.
method Network methods to identify decorrelated cryptocurrencies, Markowitz Portfolio Theory.
result Network-based portfolios outperform benchmarks with high expected returns.

Whatever information a deep neural network has gleaned from training data is encoded in its weights. How this information affects the response of the network to future data remains largely an open question. Indeed, even defining and measuring information entails some subtleties, since a trained network is a determinist…

2019-05-29abs ↗pdf ↗

DSARF models complex spatio-temporal data with deep switching auto-regressive factors.

problem Forecasting complex spatio-temporal data with recurring patterns.
method Deep switching auto-regressive factorization (DSARF) with stochastic variational inference.
result DSARF outperforms state-of-the-art methods in long- and short-term prediction accuracy.

DArtNet predicts time series data using graph structure and dynamic attributes.

problem Predicting time series data using graph structure and dynamic attributes.
method DArtNet learns static and dynamic embeddings for graph nodes and encodes history information using RNN for joint link and attribute prediction.
result Improved time series prediction accuracy on five datasets.

PS8-Net improves eight-state protein secondary structure prediction accuracy.

problem Precise prediction of eight-state protein secondary structure (PSS) is crucial in bioinformatics.
method PS8-Net is a new deep convolutional neural network (DCNN) that uses a PS8 module with skip connections to enhance accuracy.
result PS8-Net achieves 76.89% Q8 accuracy on benchmark datasets.

WaveQ uses sinusoidal regularization to optimize deep quantization for neural networks, improving both efficiency and accuracy.

problem Deep quantization reduces bitwidth but can lead to significant accuracy loss due to inter-layer dependencies.
method WaveQ employs sinusoidal regularization to learn multiple quantization parameters during gradient-based training, balancing compute efficiency and accuracy.
result WaveQ achieves accuracy preservation and efficiency gains across various deep networks, outperforming state-of-the-art techniques.

The paper develops a new approach to conditional risk measures using modular convex analysis.

problem Developing a new method for conditional risk measures.
method Random modular approach to conditional certainty equivalents and niveloids in the conditional LL^{\infty}-space.
result Retrieves a conditional variational formula for optimized certainty equivalents and applies it to the conditional entropic risk measure.

Paper constructs solutions to Bogomolny equations with specific boundary and asymptotic conditions.

problem Constructing solutions to Bogomolny equations with given boundary and asymptotic conditions.
method Using generalized Nahm pole boundary condition and real symmetry breaking condition.
result Solutions analogous to instanton solutions, satisfying different asymptotic conditions.

We extend probabilistic programming to handle conditioning on marginal distributions.

problem Conditioning probabilistic programs on marginal distributions of observable variables.
method We define and implement stochastic conditioning, allowing inference in probabilistic programs conditioned on marginal distributions.
result We demonstrate the effectiveness of stochastic conditioning in various real-life scenarios.

Paper finds necessary condition for logarithmic Minkowski problem in higher dimensions.

problem Logarithmic Minkowski problem in higher dimensions.
method Established a necessary condition through generalization and refinement of previous work.
result Generalizes and refines necessary condition for logarithmic Minkowski problem.

This paper introduces a neural operator for probabilistic conditioning.

problem Probabilistic conditioning of random variables XX given YY.
method Develops a single operator that maps any joint density to its conditional, approximated by neural operators.
result Neural operators can approximate the conditioning operator to arbitrary accuracy.