Novel LSTM network predicts pulsar timing residuals with few-shot data.
problem Predicting pulsar timing residuals with limited data.
method Long Short-Term Memory (LSTM) network optimized with model-agnostic meta-learning and particle swarm optimization.
result Robust generalization and accurate predictions across high-frequency test domains with minimal data.
Quantum machine learning improves pulsar classification in radio astronomy.
problem Improving classification of pulsars in radio astronomy.
method Used a Born machine (quantum neural network) with a single-qubit architecture.
result Comparable accuracies to classical machine learning methods achieved.
Young isolated neutron stars (INS) most commonly manifest themselves as rotationally powered pulsars (RPPs) which involve conventional radio pulsars as well as gamma-ray pulsars (GRPs) and rotating radio transients (RRATs). Some other young INS families manifest themselves as anomalous X-ray pulsars (AXPs) and soft gam…
New method uses SBI to infer magnetorotational properties of isolated pulsars.
problem Constrain magnetorotational properties of isolated Galactic radio pulsars.
method Combines population synthesis with SBI to model neutron star birth and evolution.
result Inferred μlogB=13.10−0.10+0.08, σlogB=0.45−0.05+0.05 for lognormal distributions. Accelerates pulsar light curve inference with learned representations and optimization.
problem Computational expense of Markov chain Monte Carlo methods for posterior inference.
method Combining U-Net latent representations with local simulator-guided optimization.
result 120x reduction in inference time (24 hours to 12 minutes) with accuracy preserved.
Unified Bayesian framework for PTA data analysis tackles hierarchical model issues.
problem Hierarchical Bayesian modeling challenges in PTA data analysis.
method Reparameterization strategy using Normalizing Flows (NFs) and i-nessai nested sampler.
result Improved statistical robustness and computational efficiency in PTA analysis.
New findings on algebraic structure of hyperbolic graph braid groups.
problem Classifying and understanding the algebraic structure of hyperbolic graph braid groups.
method Analyzing specific graph types (sun and pulsar graphs) and proving theorems about their braid groups.
result 3-strand braid groups of sun graphs are free, while most pulsar graphs contain surface subgroups.
Machine learning models classify celestial objects like pulsars and black holes.
problem Classifying high-energy celestial objects using photometric data.
method Applied tree-based models and RNN to classify pulsars and black holes.
result RNN showed potential for real-time object discrimination and classification.
Kichenassamy's work spans theoretical physics, from relativity to applications.
problem Clarifying the postulational basis of relativity theories.
method Introducing the C-equivalence principle to replace the strong equivalence principle.
result New insights into measurements in both special and general relativity.
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.
Consider power utility maximization of terminal wealth in a 1-dimensional continuous-time exponential Levy model with finite time horizon. We discretize the model by restricting portfolio adjustments to an equidistant discrete time grid. Under minimal assumptions we prove convergence of the optimal discrete-time strate…
New distances defined between space-times, proving some definite.
problem Defining distances between space-times.
method Introducing causal-null-compactifiable space-times and using cosmological time and null distance.
result Various definite distances defined, proving convergence of space-times.
Proposes a method to allocate time budgets in mixed criticality systems.
problem Managing execution time variability in mixed criticality systems.
method Quantifies execution time variability using statistical dispersion parameters and proposes a heuristic to allocate time budgets.
result The proposed heuristic reduces the probability of exceeding allocated budgets.
In this paper, we propose two discontinuous dynamical systems in continuous time with guaranteed prescribed finite-time local convergence to strict local minima of a given cost function. Our approach consists of exploiting a Lyapunov-based differential inequality for differential inclusions, which leads to finite-time …
Paper analyzes venture capital exit decisions under inconsistent preferences.
problem Time-inconsistent preferences in venture capital exit timing.
method Modeling four types of venture capitalists with varying levels of inconsistency.
result Time-inconsistent venture capitalists exit earlier than consistent ones.
TSMB handles time delays in multivariate time series data.
problem Varying time delays in multivariate time series data complicate predictions.
method Time Series Model Bootstrap (TSMB) framework for nonparametric time delay estimation.
result TSMB improves model performance in dynamic data environments.
Modeling regime shifts in co-evolving time series with interactions and time-dependency.
problem Discovering and modeling regime shifts in multiple time series with relationships and time-dependent behaviors.
method Modeling interactions and time-dependency in co-evolving time series using a mapping grid and dynamic network representation for regime identification and time-dependent Cox regression for regime transition probabilities.
result A principled approach for modeling interactions and time-dependency in co-evolving time series.
Logarithmic regret for continuous-time reinforcement learning.
problem Continuous-time Markov decision processes with unknown transition probabilities and holding times.
method Upper confidence reinforcement learning, mean holding time estimation, stochastic comparison of point processes.
result Logarithmic regret bound achieved in finite time.
We provide the proof that the space of time series data is a Kolmogorov space with T0-separation axiom using the loop space of time series data. In our approach we define a cyclic coordinate of intrinsic time scale of time series data after empirical mode decomposition. A spinor field of time series data comes fro…
Recently, it is proven that generalized Robertson-Walker space-times in all orthogonal subspaces of Gray's decomposition but one(unrestricted) are perfect fluid space-times. GRW space-times in the unrestricted subspace are identified by having constant scalar curvature. Generalized quasi-Einstein GRW space-times have a…
We apply the theory of continuous time random walks to study some aspects of the extreme value problem applied to financial time series. We focus our attention on extreme times, specifically the mean exit time and the mean first-passage time. We set the general equations for these extremes and evaluate the mean exit ti…
We investigate the waiting-time distribution of the absolute return in the Korean stock-market index KOSPI. We define the waiting time as a time interval during which the normalized absolute return remains continuously below a threshold rc. Through an exponential bin plot, we observe that the waiting-time distributi…
EDICT learns evidential distributions for irregular time series, improving predictions and uncertainty quantification.
problem Challenges in predicting and characterizing uncertainty for irregular time series data.
method EDICT (Evidential Distributions for Irregular Time Series) learns a continuous-time evidential distribution.
result EDICT achieves competitive performance on time series classification tasks and provides better uncertainty quantification.
Infinite rank groups found in 3-manifolds with infinite fundamental groups.
problem Understanding the structure of diffeomorphism and homeomorphism groups of 3-manifolds with infinite fundamental groups.
method Analyzing actions of barbell diffeomorphisms on spaces of embedded arcs and configuration spaces.
result Groups of diffeomorphisms and homeomorphisms have infinite rank.
Study space-like and time-like surfaces in Robertson-Walker space-times with positive nullity.
problem Characterize space-like and time-like surfaces in Robertson-Walker space-times with positive relative nullity.
method Provide necessary and sufficient conditions, local classification theorems, and analyze special spaces.
result Local classification theorems for space-like and time-like surfaces in L14(f,0) with positive relative nullity. OneShotSTL efficiently decomposes time series online, improving speed and accuracy.
problem Real-time analysis of time series data with low processing delay.
method Online seasonal-trend decomposition algorithm with O(1) update time complexity.
result 1,000 times faster than batch methods with comparable accuracy.
Proves compactness for timed-metric spaces using new distance and maps.
problem Weak convergence of space-times using timed-Hausdorff distance.
method Uses Gromov's original compactness theorem and introduces addresses.
result Establishes compactness theorem for intrinsic timed-Hausdorff convergence.
The study uses Hidden Markov Models to analyze student enrollment patterns and academic performance.
problem Limited understanding of how enrollment patterns affect academic performance.
method Applied Hidden Markov Models to categorize enrollment strategies and compare academic outcomes.
result Mixed enrollment strategies lead to better academic performance, especially during part-time semesters.
Compactness theorem for timed-metric spaces established.
problem Compactness of timed-metric spaces and causality.
method Timed-Gromov--Hausdorff distance and intrinsic timed-Hausdorff distance.
result Induces same notion of convergence as intrinsic timed-Hausdorff distance.
Generative profiling improves real-time task timing for varied resource contexts.
problem Inaccurate task timing analysis for complex hardware architectures.
method Nonparametric, conditional multi-marginal Schrödinger Bridge (MSB) formulation for synthesizing context-dependent timing profiles.
result Maximum likelihood accurate execution profiles for unseen resource contexts.
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.
DTW calculates the similarity or alignment between two signals, subject to temporal warping. However, its computational complexity grows exponentially with the number of time-series. Although there have been algorithms developed that are linear in the number of time-series, they are generally quadratic in time-series l…
To improve the efficient frontier of the classical mean-variance model in continuous time, we propose a varying terminal time mean-variance model with a constraint on the mean value of the portfolio asset, which moves with the varying terminal time. Using the embedding technique from stochastic optimal control in conti…
Proposes GDTW for aligning time series on different, incomparable spaces.
problem Dynamic time warping requires comparable spaces, but time series can live on different, incomparable spaces.
method Gromov dynamic time warping (GDTW) considers intra-relational geometry to avoid comparability requirements.
result Demonstrates effectiveness of GDTW in aligning, combining, and comparing time series on incomparable spaces.
The paper examines isotropic cosmological space-times with changing sectional curvature.
problem Cosmological space-times with changing sectional curvature.
method Analysis of a family of geometrically well-behaved cosmological space-times foliated by isotropic hypersurfaces.
result Only space-time isometries ensure the rigidity properties of isotropic cosmological space-times.
We investigate refocusing and strong refocusing of light rays in a space-time. A strongly refocusing space-time is refocusing. The converse is unknown. We construct examples of space-times which are refocusing, but not strongly so, at a particular point. These space-times are strongly refocusing at other points. The ge…
New bounds for causal effect identification in time series graphs with latent confounders.
problem Identifying causal effects in time series graphs with latent confounders over unbounded time intervals.
method Applying the Causal Identification algorithm to a constant-size segment of the time series graph.
result A bound on the number of past time steps needed for causal effect identification.
The explosion of time series data in recent years has brought a flourish of new time series analysis methods, for forecasting, clustering, classification and other tasks. The evaluation of these new methods requires either collecting or simulating a diverse set of time series benchmarking data to enable reliable compar…
TimeCNN improves forecasting by refining cross-variable interactions over time.
problem Multivariate time series forecasting struggles with dynamic and multifaceted cross-variable correlations.
method TimeCNN uses timepoint-independent convolution kernels to capture evolving relationships among variables.
result TimeCNN outperforms state-of-the-art models in real-world datasets with significant computational and speed advantages.
Paper develops a continuous-time framework for financial markets without stochastic calculus.
problem Developing continuous-time financial models without stochastic calculus.
method A general framework using conditional topologies and pseudo-distance topologies.
result No-arbitrage conditions hold in continuous time if and only if they hold in discrete time.
Continuous time framework for discrete data denoising models.
problem Efficient training and sampling for discrete data denoising models.
method Formulated as Continuous Time Markov Chains (CTMCs), efficient training using continuous time ELBO, high-dimensional CTMC simulation, novel theoretical error bound.
result Continuous time treatment enables novel theoretical error bound between generated and true data distributions.
Time-related features improve time series forecasting models.
problem Lack of explicit time-related encoding in current forecasting models limits their ability to capture cyclical and seasonal trends.
method Introducing Time Stamp Forecaster (TimeSter) to encode time-related features and integrating it with a linear backbone.
result TimeLinear model reduces MSE by 23% on benchmark datasets, improving performance with exceptional efficiency.
An RNN-Survival model predicts optimal email send times based on recipient behavior.
problem Predicting optimal send times for emails to maximize open rates.
method Recurrent Neural Network (RNN) in a survival model framework.
result The RNN-Survival model outperforms traditional survival analysis in predicting times-to-open.
This study improves estimation of locally stationary functional time series using NW method.
problem Accurately capturing time-dependence in locally stationary functional time series with time-varying covariates.
method Nadaraya-Watson (NW) estimation procedure for the conditional distribution of LSFTS.
result Established convergence rates of NW estimator for LSFTS with respect to Wasserstein distance.
The paper uses persistent homology to estimate recurrence times in multi-variate time series.
problem Estimating recurrence times in multi-variate time series with different cyclic behaviors.
method Persistent homology framework with three specialized methods.
result Validated methods on real-world data, including a new benchmark dataset.
Market timing is an investment technique that tries to continuously switch investment into assets forecast to have better returns. What is the likelihood of having a successful market timing strategy? With an emphasis on modeling simplicity, I calculate the feasible set of market timing portfolios using index mutual fu…
The usual development of the continuous-time random walk (CTRW) proceeds by assuming that the present is one of the jumping times. Under this restrictive assumption integral equations for the propagator and mean escape times have been derived. We generalize these results to the case when the present is an arbitrary tim…
Time-warping improves RNN transfer learning for diverse time scales.
problem Transfer learning for RNNs with varying time scales.
method Time-warping rescales time in LSTM models for better transfer.
result Time-warping maintains accuracy in transferring RNNs between different time scales.