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.

169,051 papers · 148 categories

Trend · papers per month

1223 · Nov 201919922001200920172026
48 results for Airline Ancillaries

Dynamic pricing model for airline ancillaries improves revenue and conversion.

problem Inefficient conventional pricing strategies for airline ancillaries.
method Developed a dynamic pricing model using AI, combining forecasting and optimization.
result Deep learning models outperform traditional machine learning techniques in online settings.

DART2 enhances multiple testing by leveraging ancillary information robustly.

problem Enhancing multiple testing power with uncertain ancillary information.
method Distance-assisted multiple testing procedure (DART2) that handles both helpful and misleading ancillary information.
result DART2 asymptotically controls FDR and improves power when ancillary information is helpful, maintaining FDR and power otherwise.

This study predicts flight delays for American Airlines using data mining and machine learning.

problem Flight delays and cancellations by American Airlines.
method Data mining and machine learning approaches, specifically Gradient Boosting Classifier Model.
result Achieved a maximum accuracy of 85.73% in predicting flight delays.

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.

This paper proposes a new method to learn combinatorial patterns for airline crew pairing optimization.

problem Enhancing airline crew pairing optimization for large-scale, complex flight networks.
method Variational Graph Auto-Encoder for learning combinatorial patterns among flight-connection graphs.
result The proposed method generates new pairings for the optimizer, improving the efficacy of airline crew pairing optimization.

Machine learning predicts flight connections for airline crew scheduling.

problem Predicting the next connecting flight for airline crews.
method Adapted neural network for multiclass classification from historical data.
result High accuracy (99.7%) in flight connection prediction.

This paper improves bidding price prediction for ancillary services markets, boosting revenues.

problem Volatility in renewable energy sources affects grid stability and revenue optimization.
method Machine learning models (SVR, DT, k-NN) and offset adjustment for pay-as-bid markets.
result The proposed approach increases potential revenues by 27.43% to 37.31% compared to baseline models.

A federated learning framework improves RUL prognosis for aircraft engines without sharing data.

problem Limited run-to-failure data samples for accurate RUL prognosis.
method Federated learning framework, decentralized validation, and robust aggregation methods.
result The federated learning framework leads to more accurate RUL prognosis for five out of six airlines.

Optimizes profit in targeted marketing across multiple markets with varying marketing expenditures.

problem Maximizing profit in a sequential marketing strategy with multiple markets and varying marketing costs.
method Near-optimal algorithms in an adversarial bandit setting, proving regret bounds for different demand curve types.
result Proved near-optimal regret bounds for the profit-maximization problem in targeted marketing.

Simpler model outperforms state-of-the-art for disaggregating census data.

problem Disaggregating detailed census data into finer-grained, high-resolution mappings.
method Aggregate learning approach using ancillary data for an interpretable model.
result Simple model outperforms state-of-the-art on disaggregation metrics.

Proposes a new GAN architecture for generating data conditioned on partial information.

problem Generating data conditioned on partial ancillary information.
method Introduces a new Adversarial Network architecture and training strategy.
result The proposed method outperforms standard Conditional GANs in generating data under partial conditioning.

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%.

Enhanced kernel framework for advanced data forecasting.

problem Complex mechanical behaviors and timefrequency dynamics in aircraft systems.
method Frequency-aware surrogate modeling with SMT kernels, extending kernel types and incorporating derivatives.
result Improved accuracy in forecasting CO2 concentrations and airline passenger traffic.

Paper forecasts dynamic transportation networks using probabilistic models.

problem Forecasting temporal evolution of transportation networks.
method Probabilistic latent network model with Bayesian inference.
result Models accurately predict future network states and community structures.

Develops a distributed least squares approximation method for regression problems.

problem Solving large-scale regression problems on distributed systems.
method Approximates local objective functions using a local quadratic form and combines estimators by weighted average.
result Statistically efficient combined estimator with one round of communication.

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…

2017-04-11abs ↗pdf ↗

This paper strengthens the central limit theorem for order statistics using relative entropy.

problem Establishing a stronger mode of convergence for central limit behavior of order statistics.
method Using relative entropy to ensure a stronger mode of convergence for central limit behavior of order statistics.
result An order O(1/n)O(1/\sqrt{n}) rate of convergence is established under mild conditions.

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…

2018-05-04abs ↗pdf ↗

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…

2013-02-18abs ↗pdf ↗

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…

2011-03-10abs ↗pdf ↗

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…

2017-02-16abs ↗pdf ↗

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…

2015-12-17abs ↗pdf ↗

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…

2013-01-24abs ↗pdf ↗

Rigidity theorem for critical points of Allen-Cahn equation on S³.

problem Rigidity of critical points with low Morse index on S³.
method Analysis of nullity and symmetries of critical points, Frankel-type theorem for nodal sets.
result Critical points with index five are symmetric and vanish on a Clifford torus, realizing the fifth width of the min-max spectrum.

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…

2016-11-01abs ↗pdf ↗

Proposes a compensation mechanism for improving individual forecast confidence.

problem Difficult to assess the quality of individual probabilistic forecasts and their utilities.
method Compensation mechanism based on fair bets and online learning.
result The proposed mechanism cannot be exploited and ensures forecasted utility matches actual utility.

Auptimizer simplifies hyperparameter tuning for machine learning models.

problem Difficulty and time-consuming hyperparameter tuning for machine learning models.
method General HPO framework that distributes computing resources and integrates various HPO techniques.
result Simplified model tuning and bookkeeping for data scientists.

A distributed bootstrap method for high-dimensional data reduces communication rounds efficiently.

problem Simultaneous inference on massive, high-dimensional data stored across many machines.
method Distributed bootstrap based on de-biased lasso with efficient cross-validation tuning.
result Theoretical lower bound on communication rounds τminτ_{\min} for statistical accuracy and efficiency.

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 dd.

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…

2016-09-02abs ↗pdf ↗

HL algorithms improve resource allocation in cloud environments.

problem Sequential decision-making under uncertainty with exogenous variables.
method HL algorithms leverage exogenous variable samples to infer counterfactual consequences.
result HL algorithms outperform classic methods and reinforcement learning in resource allocation.

Quantum-assisted Gaussian process speeds up data regression.

problem High computational complexity of Gaussian process regression for large datasets.
method Quantum-assisted sparse Gaussian process regression using random Fourier features.
result Achieves polynomial-order computational speedup compared to classical methods.