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,695 papers · 148 categories

Trend · papers per month

7142027 · May 202619922001200920172026
48 results for chronological mismatch

The paper examines how timing of observations affects causal discovery methods.

problem The sensitivity of causal discovery methods to mismatched observation timing.
method Empirical and theoretical analysis of classical and recent causal discovery methods.
result Causal discovery methods are sensitive to sampling rate and window length.

Chronological Causal Bandits (CCB) tackles dynamic causal decision-making.

problem Dynamic causal decision-making in a system where rewards depend on past interventions.
method Introduces a new MAB problem (Chronological Causal Bandit) where rewards are influenced by a dynamic causal model.
result Early findings show the CCB can transfer information between sequential MABs.

IMPaCT improves node classification in chronological split temporal graphs.

problem Domain adaptation challenges in graph data due to chronological splits.
method IMPaCT proposes a method to impose invariant properties based on realistic assumptions derived from temporal graph structures.
result IMPaCT achieves a 3.8% performance improvement over current SOTA method on the ogbn-mag graph dataset.

Chronologically consistent models maintain accuracy with time-restricted data.

problem Training data introduces lookahead bias and training leakage in large language models.
method ChronoBERT and ChronoGPT trained with only available data at each time point.
result Models achieve strong performance and competitive with larger models, mitigating lookahead bias.

Probabilistic programming aids in automatically dating ice cores, reducing manual error and uncertainty.

problem Automatically dating ice cores with high accuracy and capturing uncertainty.
method Probabilistic models and probabilistic programming for automatic inference.
result Demonstrated the use of probabilistic programming for ice core dating, showcasing its benefits and limitations.

We solve a lifecycle model in which the consumer's chronological age does not move in lockstep with calendar time. Instead, biological age increases at a stochastic non-linear rate in time like a broken clock that might occasionally move backwards. In other words, biological age could actually decline. Our paper is ins…

2018-11-25abs ↗pdf ↗

A new method extracts features from time series data using iterated sums and improves classification accuracy.

problem Time series classification challenges.
method Feature extraction using iterated-sums signature (ISS) followed by a linear classifier.
result Competitive with state-of-the-art methods on UCR archive.

New algorithm reduces performance loss in IRL with mismatched transition dynamics.

problem Performance degradation in inverse reinforcement learning due to mismatched transition dynamics.
method Proposed a robust Maximum Causal Entropy (MCE) IRL algorithm leveraging robust reinforcement learning insights.
result Empirically demonstrated stable performance improvement under transition dynamics mismatches.

We create a framework for odd Khovanov homology in the spirit of Bar-Natan's construction for the ordinary Khovanov homology. Namely, we express the cube of resolutions of a link diagram as a diagram in a certain 2-category of chronological cobordisms and show that it is 2-commutative: the composition of 2-morphisms al…

2013-10-07abs ↗pdf ↗

Reconstruct spacetime from order and number of points.

problem Reconstruct spacetime from chronological relations and i.i.d. samples.
method Relaxing hypotheses of Gromov reconstruction theorem, using random adjacency matrices and chronological relations.
result Spacetime can be recovered by only knowing 'order' and 'number' of its points.

This is not in any way meant to be a complete survey on positive curvature. Rather it is a short essay on the fascinating changes in the landscape surrounding positive curvature. In particular, details and many results and references are not included, and things are not presented in chronological order.

2009-02-25abs ↗pdf ↗

The paper addresses score-mismatched diffusion models and zero-shot conditional samplers.

problem Theoretical guarantees for score-mismatched diffusion models in zero-shot conditional sampling.
method Theoretical analysis of score-mismatched diffusion models and zero-shot conditional samplers.
result Theoretical performance guarantees with explicit dimensional dependencies for score-mismatched diffusion samplers.

The study proves timelike Ricci bounds for low regularity spacetimes using optimal transport.

problem Proving timelike Ricci bounds for spacetimes with low regularity.
method Using optimal transport to prove timelike measure-contraction property.
result Timelike curvature-dimension condition holds for C1,1\smash{\mathrm{C}^{1,1}} metrics.

Paper identifies objective mismatch in MBRL, affecting control task performance.

problem Objective mismatch in MBRL framework affects control task performance.
method Proposes re-weighting dynamics model training to mitigate mismatch.
result Likelihood of one-step ahead predictions is not always correlated with control performance.

Comparing data defined over space and time is notoriously hard, because it involves quantifying both spatial and temporal variability, while at the same time taking into account the chronological structure of data. Dynamic Time Warping (DTW) computes an optimal alignment between time series in agreement with the chrono…

2019-10-09abs ↗pdf ↗

BinaryDuo improves BNNs by coupling binary activations, outperforming state-of-the-art models.

problem Gradient mismatch in BNNs due to binarizing activations.
method Using gradient of smoothed loss function to estimate gradient mismatch, proposing BinaryDuo scheme with coupled ternary activations.
result BinaryDuo outperforms state-of-the-art BNNs on various benchmarks.

Researchers examine various causal structures for spacetimes with continuous metrics.

problem Comparing causal structures for spacetimes with continuous but not necessarily smooth metrics.
method Examined three key properties: push-up lemma, openness of chronological futures, and existence of limit causal curves.
result Spacetimes with continuous metrics do not always satisfy all three key properties.

There are various algorithms and methodologies used for automated screening of cervical cancer by segmenting and classifying cervical cancer cells into different categories. This study presents a critical review of different research papers published that integrated AI methods in screening cervical cancer via different…

2018-11-02abs ↗pdf ↗

Thompson Sampling shows polynomial regret for combinatorial semi-bandits with subgaussian rewards.

problem Finding optimal solutions in combinatorial semi-bandits with suboptimal sampling.
method Proposes Thompson Sampling with polynomial regret for linear combinatorial semi-bandits.
result Demonstrates 'mismatched sampling paradox' where knowing distributions can lead to worse performance.

Paper addresses linear regression with partially mismatched data using local search with theoretical guarantees.

problem Linear regression with partially mismatched data.
method Optimization formulation and greedy local search algorithm with theoretical guarantees.
result Local search algorithm converges to nearly-optimal solution at a linear rate under certain conditions.

PACMAN provides bounds for classification tasks considering accuracy vs. negative log-loss mismatch.

problem Mismatch between accuracy and negative log-loss in classification tasks.
method Point-wise PAC approach over generalization gap, using likelihood ratio and concentration inequalities.
result PACMAN provides point-wise PAC bounds for the generalization problem.

Current approaches for Knowledge Distillation (KD) either directly use training data or sample from the training data distribution. In this paper, we demonstrate effectiveness of 'mismatched' unlabeled stimulus to perform KD for image classification networks. For illustration, we consider scenarios where this is a comp…

2017-03-21abs ↗pdf ↗

Irrespective of local conditions imposed on the metric, any extendible spacetime U has a maximal extension containing no closed causal curves outside the chronological past of U. We prove this fact and interpret it as impossibility (in classical general relativity) of the time machines, insofar as the latter are define…

2001-11-17abs ↗pdf ↗

Supervised learning based on a deep neural network recently has achieved substantial improvement on speech enhancement. Denoising networks learn mapping from noisy speech to clean one directly, or to a spectrum mask which is the ratio between clean and noisy spectra. In either case, the network is optimized by minimizi…

2019-01-26abs ↗pdf ↗

Estimates financial market impacts of COVID-19 using time-varying kernel density.

problem Estimating the impact of COVID-19 on financial markets over time.
method Time-varying kernel density estimation with Kolmogorov-Smirnov statistic.
result Determines the chronology and regional disparities of financial market impacts.

Blockchain is a distributed database that keeps a chronologically-growing list (chain) of records (blocks) secure from tampering and revision. While computerisation has changed the nature of a ledger from clay tables in the old days to digital records in modern days, blockchain technology is the first true innovation i…

2016-12-06abs ↗pdf ↗

Empirical study compares finite- and infinite-width BNNs, revealing performance differences under model mismatch.

problem Comparing BNNs with different widths due to conflicting model properties and inference intractability.
method Empirical comparison of finite- and infinite-width BNNs, analyzing performance under model mismatch.
result Increasing width can hurt BNN performance when the model is mis-specified, and finite-width BNNs generalize better under model mismatch.

We characterize the performance of sequential information guided sensing, Info-Greedy Sensing, when there is a mismatch between the true signal model and the assumed model, which may be a sample estimate. In particular, we consider a setup where the signal is low-rank Gaussian and the measurements are taken in the dire…

2015-01-26abs ↗pdf ↗

In this study, we consider classification problems based on neural networks in data-imbalanced environment. Learning from an imbalanced data set is one of the most important and practical problems in the field of machine learning. A weighted loss function based on cost-sensitive approach is a well-known effective metho…

2019-11-25abs ↗pdf ↗

Most of the existing studies on voice conversion (VC) are conducted in acoustically matched conditions between source and target signal. However, the robustness of VC methods in presence of mismatch remains unknown. In this paper, we report a comparative analysis of different VC techniques under mismatched conditions. …

2016-12-22abs ↗pdf ↗

New algorithm solves Schrödinger bridge problem with mismatched channels.

problem Solving Schrödinger bridge problem with input and noise channel mismatch.
method Design of a Sinkhorn recursion with memory for nonlinear PDEs.
result Demonstrates solving control-affine Schrödinger bridge problem.

Study causal structure of warped spacetimes using novel pre-length spaces.

problem Understanding the causal structure of warped spacetimes.
method Novel notion of Lorentzian pre-length spaces and proof of causal completion as globally hyperbolic pre-length space.
result Causal completion of GRW spacetime is a globally hyperbolic pre-length space under Hausdorff chronological topology.

SRRM improves recursive transport surrogates in the small-discrepancy regime.

problem Insufficient understanding of recursive partitioning methods' statistical behavior and resolution in the small-discrepancy regime.
method Introduced Selective Recursive Rank Matching (SRRM) to improve the resolution of Recursive Rank Matching (RRM).
result SRRM yields a higher-fidelity practical surrogate for the Wasserstein distance at moderate additional computational cost.