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,742 papers · 148 categories

Trend · papers per month

491317 · Mar 201919922001200920172026
48 results for synoptic hours

New method combines model forecasts and real-time observations for hourly wind speed predictions.

problem Filling the six-hour gap between weather model runs for accurate hourly wind speed forecasts.
method Combines quasi-real-time observed wind speed and weather model predictions using a novel Ensemble Model Output Statistics (EMOS) strategy.
result Successfully improved wind speed predictions compared to observed data from SYNOP stations.

Dark matter in the universe evolves through gravity to form a complex network of halos, filaments, sheets and voids, that is known as the cosmic web. Computational models of the underlying physical processes, such as classical N-body simulations, are extremely resource intensive, as they track the action of gravity in …

2018-01-27abs ↗pdf ↗

The Large Synoptic Survey Telescope will complete its survey in 2022 and produce terabytes of imaging data each night. To work with this massive onset of data, automated algorithms to classify astronomical light curves are crucial. Here, we present a method for automated classification of photometric light curves for a…

2019-09-10abs ↗pdf ↗

Quarter-hour market bursts predict algorithmic trading and returns in crypto futures.

problem Predicting returns in cryptocurrency futures markets using quarter-hour market bursts.
method Analysis of trade data and Autocorrelation Map to identify and quantify algorithmic trading activity.
result Quarter-hour market bursts are associated with algorithmic trading and can predict returns.

Study analyzes order transitions in high, medium, and low market cap stocks using Markov chains.

problem Understanding order transitions in stocks of different market caps.
method First-order discrete-time Markov chain model applied to NASDAQ100 stocks.
result Limit orders exhibit higher inertia during opening hours but decrease in subsequent hours, while market orders increase.

Acute kidney injury (AKI) commonly occurs in hospitalized patients and can lead to serious medical complications. In order to optimally predict AKI before it develops at any time during a hospital stay, we present a novel framework in which AKI is continually predicted automatically from EHR data over the entire hospit…

2019-02-26abs ↗pdf ↗

This is a report of our lessons learned building acoustic models from 1 Million hours of unlabeled speech, while labeled speech is restricted to 7,000 hours. We employ student/teacher training on unlabeled data, helping scale out target generation in comparison to confidence model based methods, which require a decoder…

2019-04-02abs ↗pdf ↗

HotNAS reduces AI search time from hundreds of GPU hours to less than 3 GPU hours.

problem High time required for AI solution generation from scratch.
method HotNAS starts from a 'hot' state using pre-trained models and integrates compression during co-search.
result Reduces search time from 200 GPU hours to less than 3 GPU hours.

Can we automatically design a Convolutional Network (ConvNet) with the highest image classification accuracy under the latency constraint of a mobile device? Neural Architecture Search (NAS) for ConvNet design is a challenging problem due to the combinatorially large design space and search time (at least 200 GPU-hours…

2019-05-10abs ↗pdf ↗

Study develops electronic phenotypes of ICU patient acuity.

problem Limited time for patient acuity assessments and imprecise clinical trajectory prediction.
method Developed electronic phenotypes using automated variable retrieval in electronic health records.
result Identified three phenotypes: persistently stable, persistently unstable, and transitioning from unstable to stable.

Optimal scheduling of hydrogen production in dynamic pricing power market can maximize the profit of hydrogen producer; however, it highly depends on the accurate forecast of hydrogen consumption. In this paper, we propose a deep leaning based forecasting approach for predicting hydrogen consumption of fuel cell vehicl…

2018-06-27abs ↗pdf ↗

In this paper, we propose and investigate a variety of distributed deep learning strategies for automatic speech recognition (ASR) and evaluate them with a state-of-the-art Long short-term memory (LSTM) acoustic model on the 2000-hour Switchboard (SWB2000), which is one of the most widely used datasets for ASR performa…

2019-04-10abs ↗pdf ↗

Motivated by the literature on investment flows and optimal trading, we examine intraday predictability in the cross-section of stock returns. We find a striking pattern of return continuation at half-hour intervals that are exact multiples of a trading day, and this effect lasts for at least 40 trading days. Volume, o…

2010-05-19abs ↗pdf ↗

Stage-based hyper-parameter optimization reduces GPU-hours and training time.

problem Efficiently executing hyper-parameter optimization for deep learning models.
method Stage-based execution strategy to remove redundant computations.
result Stage-based execution outperforms trial-based method by up to 6.60 times in GPU-hours and 4.13 times in training time.

This paper accelerates D-PSGD and AD-PSGD for large-scale deep learning tasks.

problem Decreasing spectral gap with increasing number of learners hampers convergence in D-PSGD and AD-PSGD.
method Improves spectral gap while minimizing communication cost through new techniques.
result Demonstrates faster training times and lower error rates on large-scale tasks.

SIFT reduces training time by selecting samples with approximate losses.

problem Reducing training time by selecting samples with large approximate losses.
method Developed SIFT which uses early exiting to obtain approximate losses with intermediate layer representations for sample selection.
result SIFT achieves significant gains in training time and number of backpropagation steps without optimized implementation.

Discrete random variables are natural components of probabilistic clustering models. A number of VAE variants with discrete latent variables have been developed. Training such methods requires marginalizing over the discrete latent variables, causing training time complexity to be linear in the number clusters. By appl…

2019-09-18abs ↗pdf ↗

We explore efficient neural architecture search methods and show that a simple yet powerful evolutionary algorithm can discover new architectures with excellent performance. Our approach combines a novel hierarchical genetic representation scheme that imitates the modularized design pattern commonly adopted by human ex…

2017-11-01abs ↗pdf ↗

We present RAPID (Real-time Automated Photometric IDentification), a novel time-series classification tool capable of automatically identifying transients from within a day of the initial alert, to the full lifetime of a light curve. Using a deep recurrent neural network with Gated Recurrent Units (GRUs), we present th…

2019-03-29abs ↗pdf ↗

AI agents on social networks rarely engage in extended conversations.

problem Understanding the persistence of interactions in AI-agent social networks.
method Analysis of Moltbook, a social network of AI agents, using interaction half-life and spectral tests.
result Most comments on Moltbook receive a direct reply within seconds, indicating a ``fast response or silence'' regime.

Hurricanes are cyclones circulating about a defined center whose closed wind speeds exceed 75 mph originating over tropical and subtropical waters. At landfall, hurricanes can result in severe disasters. The accuracy of predicting their trajectory paths is critical to reduce economic loss and save human lives. Given th…

2018-02-01abs ↗pdf ↗

Stochastic principal component analysis (SPCA) has become a popular dimensionality reduction strategy for large, high-dimensional datasets. We derive a simplified algorithm, called Lazy SPCA, which has reduced computational complexity and is better suited for large-scale distributed computation. We prove that SPCA and …

2017-09-21abs ↗pdf ↗

Consumer Demand Response (DR) is an important research and industry problem, which seeks to categorize, predict and modify consumer's energy consumption. Unfortunately, traditional clustering methods have resulted in many hundreds of clusters, with a given consumer often associated with several clusters, making it diff…

2017-02-05abs ↗pdf ↗