A new method trains lightweight neural networks using a more complex 'booster' network.
problem Training high-performing neural networks for real-time tasks like CTR prediction.
method Rocket launching framework: a cumbersome net guides the training of a lightweight net.
result Lightweight models achieve performance previously only possible with complex models.
ANN predicts methane heat transfer in rocket engines efficiently.
problem Accurate heat transfer prediction for supercritical methane in rocket engine cooling channels.
method Artificial neural networks trained on CFD simulation data.
result ANN model predicts maximum wall temperature with convincing precision.
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.
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.
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…
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.
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.
MINIROCKET speeds up time series classification by 75x.
problem High computational complexity in time series classification.
method Random convolutional kernels and linear classifier.
result Up to 75 times faster on larger datasets.
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.
Study identifies 1,012 persistent wallet cohorts on Solana pump.fun, showing coordinated buying behavior.
problem Understanding coordinated buying behavior on Solana pump.fun.
method Two-stage detection pipeline: first-buyer-window extraction followed by persistent-cohort surfacing via graph co-occurrence.
result 1,012 persistent wallet cohorts identified, showing systematic co-buying across multiple launches.
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.
Survival analysis of 832,941 Solana token launches shows a significant decline in graduation rate.
problem Analyzing the survival rate of Solana token launches and identifying factors affecting graduation.
method Survival analysis using Kaplan-Meier and Cox proportional-hazards models.
result The survival rate of Solana token launches has declined significantly, with a 3.18x decrease from previous rates.
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.
ChatGPT launch boosted AI-related crypto assets by 10.7% to 15.6%.
problem Investor perception of AI assets after ChatGPT launch.
method Synthetic difference-in-difference methodology.
result AI-related crypto assets experienced significant returns after ChatGPT launch.
We reinvestigate the "rockets and feathers" effect between retail gasoline and crude oil prices in a new framework of fractional integration, long-term memory and borderline (non-)stationarity. The most frequently used error-correction model is examined in detail and we find that the prices return to their equilibrium …
Improved anomaly detection for launch vehicle propulsion systems using LSTM and statistical relabeling.
problem Detecting anomalies in real-time telemetry data for launch vehicles.
method Utilized LSTM networks for anomaly classification, introduced a statistical detector based on Mahalanobis distance and forward-backward detection fractions to adjust training labels.
result Precision and recall of the LSTM classifier improved by 7% and 22% respectively after statistical relabeling.
A model for learning customer preferences in a dynamic product launch setting.
problem Learning customer preferences in a setting with new product launches.
method Proposes a sequential multinomial logit (SMNL) model and a learning algorithm with a regret bound.
result Demonstrates the tier structure can mitigate risks associated with learning new products.
CDLF predicts product life-cycles in cold-start phases with high accuracy.
problem Forecasting new products in early phases when data is scarce.
method Conditional Diffusion Life-cycle Forecaster (CDLF) combining static descriptors, reference trajectories, and new observations.
result CDLF outperforms classical models in accuracy and probabilistic forecasting.
Study predicts success of crypto-tokens on Pump.fun platform.
problem Identify factors affecting the success of new crypto-tokens.
method Build predictive models using bonding curve mechanism and structural/behavioral variables.
result Conditional variables significantly improve the predictive power of token success.
Paper studies Time Series Extrinsic Regression, improving on existing methods.
problem Learning relationship between time series and continuous scalar variables.
method Motivated and studied TSER, benchmarked TSC and ML algorithms.
result Rocket algorithm achieves highest overall accuracy in TSER.
PHBench predicts Series A funding from Product Hunt launch signals with 7.8% accuracy.
problem Predicting startup Series A funding from launch signals on Product Hunt.
method Constructed PHBench from 67,292 Product Hunt posts, linked to funding records, and used a three-component ensemble model.
result Best-performing model achieved F0.5 = 0.097 and AP = 0.037, with a statistically significant advantage over logistic regression.
Backtests of structured strategies lose much of their predictive power in live trading.
problem Uncertainty in how marketed backtests predict live performance of structured strategies.
method Analysis of 1,726 structured strategies from ten global institutions.
result Raw backtests have limited portability into live trading and deteriorate sharply.
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.
Paper optimizes fiber optic communication constellations using machine learning.
problem Improving fiber optic communication performance through better constellation shaping.
method An unsupervised learning approach embedding a fiber channel model into neural networks.
result Improved performance up to 0.13 bit/4D in simulation and experimentally up to 0.12 bit/4D.
We study a class of fully nonlinear elliptic equations on closed Hermitian manifolds. We derive C∞ {\em a priori} estimates, and then prove the existence of admissible solutions. In the approach, a new Hermitian metic is constructed to launch the method of continuity.
Cloud-native simulator studies global trading latencies.
problem Understanding latencies in planetary-scale automated trading systems.
method Cloud-native, open-source simulator with distributed clients.
result Demonstrates latencies in real-world trading systems.
Deep learning boosts cable capacity by 19%.
problem Maximizing cable capacity under power constraints.
method Optimized launch powers using deep neural networks.
result 19% increase in capacity per Watt.
We develop parallel predictive entropy search (PPES), a novel algorithm for Bayesian optimization of expensive black-box objective functions. At each iteration, PPES aims to select a batch of points which will maximize the information gain about the global maximizer of the objective. Well known strategies exist for sug…
Satyam simplifies groundtruth collection for machine vision tasks.
problem Difficulty in collecting accurate groundtruth for machine vision systems.
method Crowdsourcing through Amazon Mechanical Turk, automation of task creation and quality control.
result Groundtruth collected by Satyam is comparable to that of trained experts and provides equivalent ML performance.
On 2 November 2009, the Financial Bubble Experiment was launched within the Financial Crisis Observatory (FCO) at ETH Zurich (\url{http://www.er.ethz.ch/fco/}). In that initial report, we diagnosed and announced three bubbles on three different assets. In this latest release of 23 December 2009 in this ongoing experime…
The paper analyzes the pricing of a new compute futures asset.
problem Uncertainty in AI adoption and pricing of compute capital.
method An asset-pricing framework for compute futures, including synthetic futures pricing.
result Preliminary evidence suggests a positive compute risk premium.
Deep learning enhances jamming and defense in wireless communications.
problem Improving wireless communication security against jamming attacks.
method Adversarial machine learning for jamming and a GAN for training data augmentation.
result Deep learning significantly reduces transmitter performance compared to random jamming.
We use a control framework to analyze the digital vendor's profit maximization problem. The vendor captures market share by focusing costly effort on post-launch product maintenance, which influences user perception of the product and drives a revenue stream associated with product use. Our theoretical results show nec…
New Roman pipeline detects astronomical transients.
problem Automated detection of transients from Roman Space Telescope data.
method Machine learning model RuBR for distinguishing real from fake detections.
result Effective real-bogus classification in Roman era.
Framework for AI healthcare products from concept to market.
problem Failure of AI products to reach clinics despite promising potential.
method Decision-making framework for AI healthcare product development.
result Guides through a three-phase process to market launch of validated AI products.
In this work we simulate null geodesics for the Bonnor massive dipole metric by implementing a symbolic-numerical algorithm in Sage and Python. This program is also capable of visualizing in 3D, in principle, the geodesics for any given metric. Geodesics are launched from a common point, collectively forming a cone of …
Examines insurance market development and similarity post-2004 EU enlargement.
problem Comparing insurance markets of EU old and new members post-enlargement.
method Analyzes data from 2004 to present to compare insurance markets.
result Identifies similarities and differences in insurance markets post-2004 enlargement.
Fashion-Gen dataset offers high-res fashion images and descriptions for research.
problem Lack of high-quality, detailed fashion image datasets for research.
method Created a large dataset of fashion images and descriptions, provided baseline results, and launched a challenge.
result Baseline results on image generation and conditioning on text descriptions.
There are many fundamental algorithmic problems on triangulated 3-manifolds whose complexities are unknown. Here we study the problem of finding a taut angle structure on a 3-manifold triangulation, whose existence has implications for both the geometry and combinatorics of the triangulation. We prove that detecting ta…
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.
The paper improves A/B testing for non-Gaussian data, ensuring reliable results with large sample sizes.
problem Inaccurate A/B testing results due to non-normal data and unequal sample sizes.
method Derives explicit formulas for minimum sample size and introduces an Edgeworth-based correction.
result Corrected method improves reliability of A/B testing in real-world conditions.
Efficient method defends privacy in federated learning without accuracy loss.
problem Privacy attacks on federated learning by reconstructing and identifying local data.
method Random noise perturbation method that allows recovery of true gradients.
result Strong privacy protection without sacrificing learning accuracy.
Generative GAN improves classifier performance with limited training data.
problem Limited training data for black-box API attacks.
method Generative adversarial network (GAN) to generate synthetic training data.
result Improves classifier performance with synthetic data.
A new model predicts fashion demand 6-12 months ahead, boosting retailer profits.
problem Accurate demand forecasting for fashion retailers with short product life cycles.
method Product age-based forecast model, incorporating unique feature engineering.
result Significant revenue uplift of 41% compared to retailer's plan.
Cryptocurrencies use blockchain tech for secure transactions, offering new research opportunities.
problem Misunderstanding of cryptocurrency technology and lack of empirical data.
method Analyzing detailed transaction data and summarizing statistics.
result Opportunity for academic research in financial economics.
The Langlands Program was launched in the late 60s with the goal of relating Galois representations and automorphic forms. In recent years a geometric version has been developed which leads to a mysterious duality between certain categories of sheaves on moduli spaces of (flat) bundles on algebraic curves. Three years …
Credit Suisse First Boston (CSFB) launched in 1997 the model CreditRisk+ which aims at calculating the loss distribution of a credit portfolio on the basis of a methodology from actuarial mathematics. Knowing the loss distribution, it is possible to determine quantile-based values-at-risk (VaRs) for the portfolio. An o…