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

10213141 · Jun 202019922001200920172026
48 results for rocket engine

Paper uses deep reinforcement learning for better control of rocket engines during start-up phases.

problem Lack of optimal control during transient phases of liquid rocket engines.
method Deep reinforcement learning approach for optimal control of a gas-generator engine's continuous start-up phase.
result Deep reinforcement learning controller achieves highest performance and minimal computational effort.

Improved ROCKET algorithm for brain activity classification.

problem Classifying multivariate time series data from brain activity.
method Detach-Rocket Ensemble, leveraging pruning and ensemble methods.
result Competitive classification accuracy and interpretable channel relevance.

We study the Bondi-Sachs rockets with nonzero cosmological constant. We observe that the acceleration of the systems arises naturally in the asymptotic symmetries of (anti-) de Sitter spacetimes. Assuming the validity of the concepts of energy and mass previously introduced in asymptotically flat spacetimes, we find th…

2011-05-17abs ↗pdf ↗

Rocket algorithm classifies time-series data efficiently using random projections and natural sparsity.

problem Time-series classification challenges in diverse fields.
method Random convolutional kernels, non-linear transformation, compressed sensing framework.
result Rocket algorithm preserves discriminative patterns in time-series data and expresses inherent sparsity.

Fusion framework improves time series classification across different datasets.

problem Kernel-based methods like Rocket perform inconsistently across datasets.
method Fusion-3 framework that adaptively fuses three representations (Rocket, SAX, SFA) based on dataset properties.
result Fusion-3 framework yields small but consistent average improvements over Rocket on 113 UCR datasets.

ROCKET speeds up time series classification without sacrificing accuracy.

problem High computational complexity and intractability of existing time series classification methods.
method Simple linear classifiers using random convolutional kernels.
result Achieves state-of-the-art accuracy with significantly reduced computational expense.

The paper proposes an ensemble of convolution-based methods for fault detection in gearboxes.

problem Fault detection in planetary gearboxes using vibration signals.
method Ensemble of three convolution kernel-based methods (ROCKET, 1D CNN with ResNet, FCN).
result Outperforms other approaches with over 98.8% accuracy.

Study on stability of network flow shrinkers with findings on instability of specific shapes.

problem Stability of regular shrinkers in network flow.
method Analysis of self-similarly shrinking solutions called regular shrinkers.
result All regular shrinkers with two or more enclosed regions can be perturbed away. Specific shapes like 4-ray star, 5-ray star, fish, and rocket are unstable among those with one enclosed region.

Study assesses data-driven and physics-based SGS models for transcritical combustion.

problem Challenges in simulating high-pressure combustion systems due to complex fluid behaviors.
method Comparison of physics-based and random forest machine learning models in turbulent transcritical non-premixed flames.
result Random forest models can effectively model subgrid stresses, providing insight into their formation.

A cased-based reasoning method predicts rare events on strategic sites using satellite imagery.

problem Manual prediction of rare events on strategic sites is impractical due to large datasets.
method Case-based reasoning approach incorporating expert knowledge for irregular time series and small datasets.
result The method significantly outperforms random selection on challenging applications.

iMOCA optimizes multiple objectives with continuous approximations for resource efficiency.

problem Optimizing multiple objectives with continuous function approximations that balance accuracy and evaluation cost.
method Information-Theoretic Multi-Objective Bayesian Optimization with Continuous Approximations (iMOCA) selects input and function approximations to maximize information gain per unit cost.
result iMOCA significantly improves over existing single-fidelity methods in approximating the optimal Pareto set.

Study benchmarks TSC algorithms in distinguishing diffusions using the likelihood ratio test.

problem Benchmarking optimality of TSC algorithms in distinguishing diffusion processes.
method Proposes to benchmark TSC algorithms using the likelihood ratio test (LRT).
result LRT benchmarks are computationally efficient and can be applied to various time series types.

Deep learning speeds up engine calibration for varied driving conditions.

problem Optimizing engine operation during transient driving cycles for better fuel economy and emissions.
method Parallel simulation-driven machine learning using a physics-based engine simulator.
result Deep neural network surrogate model predicts engine performance and emissions accurately and quickly.

This review discusses challenges and solutions for AI in chemical engineering.

problem Challenges in applying classical machine learning to chemical engineering data.
method Identifying four data characteristics and discussing their applications and solutions.
result Current research extends data science and machine learning to handle chemical engineering data challenges.

Paper proposes verifier engineering for improving foundation models.

problem Challenges in providing effective supervision signals for foundation models.
method Leverages automated verifiers to perform verification tasks and deliver feedback.
result Verifier engineering can enhance foundation models' capabilities.

New metrics quantify implementation risk in portfolio backtesting, revealing systematic differences in engine implementations.

problem Systematic divergence in backtested portfolio metrics due to differences in engine implementations.
method Formalized implementation risk, proposed four metrics, executed 15 strategies through five engines, analyzed source-code defects.
result Implementation risk introduces measurable ambiguity in performance attribution, but does not alter investment decisions.

This paper uses machine learning to assist automation engineers in decision making.

problem Imperfect decision making by automation engineers leads to multiple iterations and increased time for software development.
method Defined challenges and proposed solutions using machine learning for automation engineering, including code classification, finding similar code snippets, and hardware selection.
result Paragraph embedding techniques achieved an F1-score of 72% for classifying automation using code snippets, and autoencoder models for hardware recommendation achieved p@3 and p@5 of 0.79 and 0.95, respectively.

Paper improves full-text search engines for fast exact NNS in binary codes.

problem Efficient nearest neighbor search in Hamming space for full-text search engines.
method Revisits and combines three techniques from information retrieval: bit operation, subs-code filtering, and data preprocessing with permutation.
result Significant speed-ups for NNS in binary codes over state-of-the-art term match approach.

Predicts coherence from quantum heat engine noise using machine learning.

problem Predicting coherence in quantum heat engines from nonequilibrium fluctuations.
method Developed a machine learning protocol using K-Nearest Neighbor (KNN) model.
result Machine learning successfully predicts coherence from quantum heat engine noise.

Automated feature engineering improves interpretable models without manual work.

problem Lack of interpretability in complex models causes trust and stability issues.
method Use elastic black-box models to create simpler, interpretable glass-box models.
result Extracted features from complex models improve linear model performance.

SAFE automates feature engineering for industrial tasks efficiently and scalably.

problem Efficiency and scalability of automatic feature engineering methods for industrial tasks.
method SAFE (Scalable Automatic Feature Engineering) method, which provides excellent efficiency and scalability.
result SAFE method provides prominent efficiency and competitive effectiveness in industrial tasks.

In recent years several trading platforms appeared which provide a backtest engine to calculate historic performance of self designed trading strategies on underlying candle data. The construction of a correct working backtest engine is, however, a subtle task as shown by Maier-Paape and Platen (cf. arXiv:1412.5558 [q-…

2015-09-28abs ↗pdf ↗

Paper discusses challenges in deploying ML models for structural engineering.

problem Challenges in deploying machine learning models for structural engineering applications.
method Illustrates challenges through two examples, focusing on model overfitting, underspecification, training data representativeness, variable omission bias, and cross-validation.
result Highlights the importance of rigorous model validation techniques.

Factor Engine simplifies financial factor computation and analysis in Python.

problem Efficient computation and analysis of financial factors.
method Modular, extensible Python library with decorators, integrates with data science ecosystem.
result Mispricing factors computed by Factor Engine and Stata implementation are highly similar.

The authors seek financial datasets to benchmark feature engineering methods on US market data.

problem Improving predictive models for financial data science competitions.
method Feature engineering methods applied to multivariate time-series data from the US market.
result Predictive power of models tested against Numerai-Signals targets.

Generative Bayesian Computation improves surrogates for expensive simulations.

problem Limitations of Gaussian process surrogates in handling complex, non-stationary data.
method Generative Bayesian Computation via Implicit Quantile Networks (IQNs).
result Generative Bayesian Computation outperforms traditional Gaussian process methods across various benchmarks.

This paper introduces Probability Engineering to improve deep learning models.

problem Challenges in traditional probabilistic modeling for AI applications.
method Treats learned probability distributions as engineering artifacts and actively modifies them.
result Improves robustness, efficiency, adaptability, and trustworthiness of deep learning models.

An innovative method optimizes engine calibration to improve efficiency and reduce emissions.

problem Complex engines with many tunable parameters require efficient calibration methods.
method Combines Principal Component Decomposition with constrained Bayesian Optimization to minimize pressure curve deviation.
result Optimal engine calibration found after 64.4s with a 0.017% efficiency gain.

FeatureEnVi aids in feature engineering with visual analytics.

problem Insufficient support for feature engineering in visual analytics tools.
method Stepwise selection and semi-automatic extraction approaches.
result Extracts heavily engineered features evaluated by multiple metrics.

Graph Neural Networks improve machine learning on relational databases.

problem Training machine learning models on relational databases requires costly data extraction and feature engineering.
method Uses Graph Neural Networks to extract features from relational databases.
result Outperforms state-of-the-art automatic feature engineering methods.

Survey and new results link hydrodynamics, molecular physics, and financial engineering.

problem Understanding financial engineering topics like Asian options and volatility swaps.
method Linking Kevin waves, Klein-Kramers, and Kolmogorov equations to financial models.
result Corrected the original solution of the Kolmogorov equation.