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

18375573 · Jun 202019922001200920172026
48 results for Exoplanet Transits

Bayesian Gaussian Processes improve exoplanet transit and Hubble constant inference.

problem Improving exoplanet transit and Hubble constant inference using Bayesian Gaussian Processes.
method Kernel-, mean- and noise-marginalised Gaussian Processes with evidence-based model comparison and transdimensional sampling.
result Inferred Hubble constant H0H_0 values from cosmic chronometers, baryon acoustic oscillations and combined datasets are 66±6kms1Mpc166 \pm 6\, \mathrm{km}\,\mathrm{s}^{-1}\,\mathrm{Mpc}^{-1}, 67±10kms1Mpc167 \pm 10\, \mathrm{km}\,\mathrm{s}^{-1}\,\mathrm{Mpc}^{-1} and 69±6kms1Mpc169 \pm 6\, \mathrm{km}\,\mathrm{s}^{-1}\,\mathrm{Mpc}^{-1}, respectively.

Transformer model removes noise from light curves efficiently.

problem Challenges in processing astrophysical light curves due to noise.
method Denoising Time Series Transformer (DTST) model trained with masked objective.
result DTST model excels at removing noise and outliers in time series datasets.

Proposes GPLFR for predicting high-dimensional outputs with few data.

problem Predicting high-dimensional outputs from limited data.
method GPLFR combines Gaussian process and linear-Gaussian decoding for high-dimensional prediction.
result GPLFR outperforms existing methods in predicting high-dimensional outputs.

We describe a method for removing the effect of confounders in order to reconstruct a latent quantity of interest. The method, referred to as half-sibling regression, is inspired by recent work in causal inference using additive noise models. We provide a theoretical justification and illustrate the potential of the me…

2015-05-12abs ↗pdf ↗

In this study we introduce a new technique for symbolic regression that guarantees global optimality. This is achieved by formulating a mixed integer non-linear program (MINLP) whose solution is a symbolic mathematical expression of minimum complexity that explains the observations. We demonstrate our approach by redis…

2017-10-29abs ↗pdf ↗

GPRNs accurately model stellar activity affecting RV measurements of exoplanets.

problem Stellar activity limits detection and characterisation of exoplanets.
method Gaussian Process Regression Networks (GPRNs) for joint analysis of RV data and stellar activity indicators.
result GPRNs accurately describe solar RV data, correlating with activity at separations of a few days.

The paper discusses the impact of prior densities on Bayesian model selection.

problem The sensitivity of marginal likelihood to prior choice in Bayesian model selection.
method Analyzes the role of prior densities in model selection, discusses improper priors, and proposes solutions.
result Marginal likelihood can be sensitive to prior choice, but improper priors can still be used with caution.

Develops methods to simulate rare transitions in molecular systems.

problem Rare transitions between metastable states in molecular systems are difficult to study due to limited data.
method Two novel methods: chain-based and midpoint-based approaches.
result Demonstrates effectiveness of methods in both data-rich and data-scarce scenarios.

The paper models market crashes as phase transitions, finding dynamic transitions offer better predictions.

problem Understanding and predicting extreme financial events like market crashes.
method Employing phase transition theory, focusing on endogenous crashes, and comparing DPT, CPT, and SPT.
result Dynamic phase transitions provide more accurate predictions of market crashes compared to critical and stochastic models.

This paper establishes an equivalence between transitive double Lie algebroids and core diagrams.

problem Understanding and characterizing transitive double Lie algebroids.
method Using core diagrams and equivalence of transitive core diagrams with transitive double Lie groupoids.
result Transitive double Lie algebroids are completely determined by their core diagrams.

Dual-T method improves transition matrix estimation in noisy label learning.

problem Large estimation error in noisy class posterior leads to poor transition matrix estimation.
method Introducing an intermediate class to avoid direct estimation of noisy class posterior, factorizing the transition matrix into two easier-to-estimate matrices.
result The dual-T estimator leads to better classification performances.

New algorithm achieves data-dependent regret bounds in MDPs with unknown transitions.

problem Achieving best-of-both-worlds guarantees with data-dependent regret bounds in MDPs with unknown transitions.
method Optimistic follow-the-regularized-leader algorithm with new optimistic Q-function estimators and transition bonus.
result First-order, second-order, and path-length bounds with polylog(T) regret in the stochastic regime.

Study shows Elo models fail to accurately measure transitive strength in competitive games.

problem Elo models fail to correctly identify the transitive component in real-world competitive games.
method Investigated the challenge of identifying the transitive component in games, proposed an extension of the Elo score.
result Disc ranking system assigns two scores: skill and consistency.

Proves robust transitivity for geodesic flows from metrics with conjugate points.

problem Transitivity of geodesic flows from metrics with conjugate points.
method General criterion for robust transitivity of partially hyperbolic geodesic flows.
result First example of a C2C^2 open set of Riemannian metrics with conjugate points and transitive geodesic flow.

We present a continuous-time maximum likelihood estimation methodology for credit rating transition probabilities, taking into account the presence of censored data. We perform rolling estimates of the transition matrices with exponential time weighting with varying horizons and discuss the underlying dynamics of trans…

2009-12-23abs ↗pdf ↗

We generalized the periodic links to \emph{transitive} links in a 33-manifold MM. We find a complete classification theorem of transitive links in a 33-dimensional sphere R3\mathbb{R}^3. We study these links from several different aspects including polynomial invariants using the relation between link polynomials of…

2015-04-07abs ↗pdf ↗

A new method for ILO with transition model disparity using an intermediary policy.

problem Learning tasks from expert observations with different transition dynamics.
method Training an intermediary policy to match the state transitions of the expert dataset.
result Our method outperforms existing ILO approaches with transition model mismatch.

This paper identifies and estimates the label noise transition matrix without ground truth labels.

problem Learning with noisy labels and identifying the noise transition matrix.
method Building on Kruskal's identifiability results, the paper characterizes the identifiability of the label noise transition matrix for the generic case at the instance level.
result The necessity of multiple noisy labels in identifying the noise transition matrix for the generic case at the instance level.

ISOKANN learns collective variables and effective dynamics for metastable transitions.

problem Understanding metastable transitions in complex molecular systems.
method Integrates Koopman operators with neural networks to extract CVs and effective dynamics.
result Reconstructs coarse-grained kinetics and reproduces transition times across barriers.

In the following paper we investigate the question: when is a transitive topological groupoid continuously isomorphic to a Lie groupoid? We present many results on the matter which may be considered generalizations of the Hilbert's fifth problem to this context. Most notably we present a "solution" to the problem for p…

2018-05-06abs ↗pdf ↗

Characterizing the phase transitions of convex optimizations in recovering structured signals or data is of central importance in compressed sensing, machine learning and statistics. The phase transitions of many convex optimization signal recovery methods such as 1\ell_1 minimization and nuclear norm minimization are…

2015-09-15abs ↗pdf ↗

Diffusion maps help learn complex quantum phase transitions from data.

problem Learning quantum phase transitions from experimental data is challenging.
method Diffusion maps for nonlinear dimensionality reduction and spectral clustering.
result Diffusion maps can learn complex phase transitions unsupervised.

We develop a transitional geometry, that is, a family of geometries of constant curvatures which makes a continuous connec-tion between the hyperbolic, Euclidean and spherical geometries. In this transitional setting, several geometric entities like points, lines, dis-tances, triangles, angles, area, curvature, etc. as…

2014-11-21abs ↗pdf ↗

Study phase transitions with prescribed mean curvature in Riemannian manifolds.

problem Understanding phase transitions with prescribed mean curvature in geometric settings.
method Analyzing solutions to inhomogeneous semilinear elliptic PDEs, establishing bounds and asymptotics.
result Established upper and lower bounds for eigenvalues of phase transition problems.

Constructs special Lagrangian 3-spheres in non-Kähler compact threefolds.

problem Understanding transitions between Kähler and non-Kähler geometries.
method Analyzes topological transitions of Calabi-Yau threefolds to construct special Lagrangian cycles.
result Special Lagrangian 3-spheres emerge from non-Kähler geometries, exchanging holomorphic 2-cycles for 3-cycles.

Quasi-transitive graphs quasi-isometric to planar graphs can be upgraded to Cayley graphs.

problem Quasi-transitive graphs quasi-isometric to planar graphs need to be upgraded to Cayley graphs.
method Upgrading a planar graph to a Cayley graph.
result Quasi-transitive graphs quasi-isometric to planar graphs can be upgraded to Cayley graphs.

New model of vague knowledge without strict partitions or transitivity.

problem Standard economic models of information fail to capture real-world vague knowledge.
method Relaxing assumptions of transitivity and partition structure to formalize vague knowledge.
result Vague knowledge can distinguish some states but not partition the state space.

Study models forest transitions with deep learning for parameter estimation.

problem Complex dynamics of forest, agricultural, and abandoned lands.
method Developed a stochastic differential equation model and used deep learning for parameter estimation.
result Deep learning approach estimates model parameters from time-series data.