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.
This study analyzes and predicts airline delays using machine learning models.
problem Improving the accuracy of predicting airline flight delays.
method The study combines airline and weather datasets, using various machine learning models (Logistic Regression, Naive Bayes, K-NN, Decision Tree, Random Forest) to predict flight delays.
result The Random Forest model achieved an accuracy of 82% in predicting flight delays of 15 minutes or more.
Travel providers such as airlines and on-line travel agents are becoming more and more interested in understanding how passengers choose among alternative itineraries when searching for flights. This knowledge helps them better display and adapt their offer, taking into account market conditions and customer needs. Som…
Passenger Name Records (PNRs) are at the heart of the travel industry. Created when an itinerary is booked, they contain travel and passenger information. It is usual for airlines and other actors in the industry to inter-exchange and access each other's PNR, creating the challenge of using them without infringing data…
Proposes ML methods for robust price-sensitivity estimation in dynamic pricing.
problem Estimating price elasticities robustly in the presence of feature-dependent sensitivity.
method Poisson semi-parametric model with two-stage estimation: first-stage ML for observed purchases, second-stage Bayesian GLM for price-sensitivity.
result Reduces estimation error in price-sensitivity parameters from 25% to 4%.
In cargo logistics, a key performance measure is transport risk, defined as the deviation of the actual arrival time from the planned arrival time. Neither earliness nor tardiness is desirable for customer and freight forwarders. In this paper, we investigate ways to assess and forecast transport risks using a half-yea…
We present a new, fully generative model of optical telescope image sets, along with a variational procedure for inference. Each pixel intensity is treated as a Poisson random variable, with a rate parameter dependent on latent properties of stars and galaxies. Key latent properties are themselves random, with scientif…
This work introduces the concept of parametric Gaussian processes (PGPs), which is built upon the seemingly self-contradictory idea of making Gaussian processes parametric. Parametric Gaussian processes, by construction, are designed to operate in "big data" regimes where one is interested in quantifying the uncertaint…
Although aviation accidents are rare, safety incidents occur more frequently and require a careful analysis to detect and mitigate risks in a timely manner. Analyzing safety incidents using operational data and producing event-based explanations is invaluable to airline companies as well as to governing organizations s…
Suppose C is a compact, n-edged two-cell of the centered dual decomposition of a locally finite set in the hyperbolic plane, a coarsening of the Delaunay tessellation which was introduced in the author's prior work. We describe an effectively computable lower bound on the area of C, given an n-tuple of positive…
In this paper, we propose an active learning algorithm and models which can gradually learn individual's preference through pairwise comparisons. The active learning scheme aims at finding individual's most preferred choice with minimized number of pairwise comparisons. The pairwise comparisons are encoded into probabi…
Gaussian processes are rich distributions over functions, which provide a Bayesian nonparametric approach to smoothing and interpolation. We introduce simple closed form kernels that can be used with Gaussian processes to discover patterns and enable extrapolation. These kernels are derived by modelling a spectral dens…
We introduce a stochastic model to explain a double power-law distribution which exhibits two different Paretian behaviors in the upper and the lower tail and widely exists in social and economic systems. The model incorporates fitness consideration and noise fluctuation. We find that if the number of variables (e.g. t…
We introduce a semi-supervised discrete choice model to calibrate discrete choice models when relatively few requests have both choice sets and stated preferences but the majority only have the choice sets. Two classic semi-supervised learning algorithms, the expectation maximization algorithm and the cluster-and-label…
We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to compute exact probabilities for knots in this model. As expected, most diagrams with 1…
The general theory of boundary value problems for linear elliptic wedge operators (on smooth manifolds with boundary) leads naturally, even in the scalar case, to the need to consider vector bundles over the boundary together with general smooth fiberwise multiplicative group actions. These actions, essentially trivial…
Deep kernel learning combines the non-parametric flexibility of kernel methods with the inductive biases of deep learning architectures. We propose a novel deep kernel learning model and stochastic variational inference procedure which generalizes deep kernel learning approaches to enable classification, multi-task lea…
Building a large image dataset with high-quality object masks for semantic segmentation is costly and time consuming. In this paper, we introduce a principled semi-supervised framework that only uses a small set of fully supervised images (having semantic segmentation labels and box labels) and a set of images with onl…
We propose a method (TT-GP) for approximate inference in Gaussian Process (GP) models. We build on previous scalable GP research including stochastic variational inference based on inducing inputs, kernel interpolation, and structure exploiting algebra. The key idea of our method is to use Tensor Train decomposition fo…
This paper quantifies how well random neural networks can approximate continuous functions.
problem Approximating continuous functions with random neural networks.
method Investigates three types of random neural networks: infinite width, subsampled, and corrected. Analyzes approximation rates and provides bounds.
result A function can be approximated with complexity proportional to δ and d.
A novel hash learning approach using codewords in Hamming space.
problem Hash learning for supervised, unsupervised, and semi-supervised scenarios.
method Uses codewords inferred from data to capture grouping aspects of hash codes, with regularization for automatic codeword selection. Solves via Block Coordinate Descent and SVM.
result Demonstrates superior performance in content-based image retrieval.
We develop an automated variational method for inference in models with Gaussian process (GP) priors and general likelihoods. The method supports multiple outputs and multiple latent functions and does not require detailed knowledge of the conditional likelihood, only needing its evaluation as a black-box function. Usi…