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

0.3%0.5%0.8%0.3% · Oct 201619922001200920182026
38 results for sewer overflow

This paper uses unsupervised learning and dimensionality reduction to optimize sewer system control.

problem Challenges in controlling large sewer systems efficiently.
method Divide sewer system into subcatchments, collect factors, cluster, apply PCA, simulate control scenarios.
result Priority control measures applied to clusters with similar hydraulic characteristics yield the best overflow reduction.

DeepCSO model forecasts CSO events from multiple sewer structures in near real-time.

problem Forecasting Combined Sewer Overflow (CSO) events at a citywide level.
method Multi-task deep learning model combining data-driven and deterministic methods.
result Deep learning model outperforms traditional methods in CSO event forecasting.

Deep neural network predicts semantic labels for source code.

problem Difficulty in labeling and understanding new programming languages and functionalities.
method Language-agnostic deep convolutional neural network trained on Stack Overflow code snippets.
result Mean area under ROC of 0.957 and top-1 accuracy of 86.6% on Github code documents.

Study investigates micro-event detection on FLOSS version releases from Stack Overflow.

problem Detecting micro-events in FLOSS version release events from textual messages.
method Developed pipelines using LDA topic modeling, hSBM topics, and sentiment analysis; optimized feature spaces with RFECV; evaluated models with statistical analysis.
result Found characteristic changes in topics or sentiment features before or after FLOSS version releases.

WrapNet optimizes inference for low-resolution neural networks by using 8-bit additions.

problem Reducing multiplication complexity in low-resolution neural networks.
method Adapting neural networks to use low-resolution (8-bit) additions in accumulators, with a cyclic activation layer and overflow penalty regularizer.
result Achieves comparable classification accuracy to 32-bit counterparts using low-resolution additions.

LiteMORT reduces memory usage for GBDT models by 30% with improved accuracy.

problem Memory inefficiency in GBDT models, especially with adaptive compact distributions.
method Share memory, implicit merging, adaptive histogram resizing.
result Significant reduction in memory usage with improved accuracy.

Determining the programming language of a source code file has been considered in the research community; it has been shown that Machine Learning (ML) and Natural Language Processing (NLP) algorithms can be effective in identifying the programming language of source code files. However, determining the programming lang…

2018-09-21abs ↗pdf ↗

New algorithm reduces costs and latency for large language model inference.

problem Optimizing inference costs and latency for large language models with GPU constraints.
method Formulated as an online scheduling problem with endogenous memory growth, introduced fluid model and WAIT algorithms.
result Reduced costs and latency, especially in near-overloaded and overloaded regimes.

We present a semi-supervised learning algorithm for learning discrete factor analysis models with arbitrary structure on the latent variables. Our algorithm assumes that every latent variable has an "anchor", an observed variable with only that latent variable as its parent. Given such anchors, we show that it is possi…

2015-11-10abs ↗pdf ↗

People are increasingly relying on the Web and social media to find solutions to their problems in a wide range of domains. In this online setting, closely related problems often lead to the same characteristic learning pattern, in which people sharing these problems visit related pieces of information, perform almost …

2016-10-18abs ↗pdf ↗

In this study, we investigate the limits of the current state of the art AI system for detecting buffer overflows and compare it with current static analysis tools. To do so, we developed a code generator, s-bAbI, capable of producing an arbitrarily large number of code samples of controlled complexity. We found that t…

2018-08-29abs ↗pdf ↗

New method reduces SBL complexity from cubic to linear, improving scalability.

problem Sparse Bayesian Learning's high computational complexity for large feature spaces.
method DQN-SBL, a diagonal Quasi-Newton method for SBL.
result DQN-SBL achieves competitive generalization with sparse models, scaling well to large-scale problems.

A new method for estimating probabilities and risks using Markov processes.

problem Computational difficulties in classical importance sampling for latent Markov models.
method Proposes a new importance sampling framework that minimizes estimator variance.
result Shows logarithmic efficiency of the proposed estimator.

Modeling time series with jumps using neural networks and stochastic processes.

problem Capturing the dynamics of time series with both continuous flows and discrete jumps.
method Introducing Neural Jump Stochastic Differential Equations (Neural JSDEs) that extend Neural Ordinary Differential Equations (Neural ODEs) with a stochastic process term.
result Demonstrated the model's predictive capabilities on various datasets, including Hawkes processes, Stack Overflow awards, medical records, and earthquake monitoring.

Optimizes communication in federated learning using rate-distortion theory.

problem Reduces communication cost in federated learning while maintaining model accuracy.
method Applies rate-distortion theory to model updates, proposing distortion as a proxy for accuracy.
result Near-optimal communication reduction, outperforming other methods on a FL benchmark.

Learning from the crowd has become increasingly popular in the Web and social media. There is a wide variety of crowdlearning sites in which, on the one hand, users learn from the knowledge that other users contribute to the site, and, on the other hand, knowledge is reviewed and curated by the same users using assessm…

2016-12-14abs ↗pdf ↗

XLA compiler extension improves memory efficiency for machine learning.

problem Memory constraints limit the scalability of memory-intensive machine learning algorithms.
method Developed an XLA compiler extension that adjusts algorithm data-flow representation to fit memory limits.
result k-nearest neighbour and sparse Gaussian process regression can be run at larger scales.

A framework to compare federated learning algorithms in high-dimensional settings.

problem Comparing the performance of federated learning algorithms in high-dimensional settings.
method Formulating federated learning as a multi-criterion objective and analyzing a linear regression model.
result Federated Averaging with simple client fine-tuning achieves the same asymptotic risk as more intricate approaches and outperforms without personalization.

Score-fPINN tackles high-dimensional FPL equations using fractional score functions.

problem High-dimensional Fokker-Planck-Lévy equations with non-Brownian processes.
method Fractional score function and Physics-informed neural networks (PINN) to solve CoD and numerical overflow.
result Effective solution to high-dimensional FPL equations without fractional Laplacian.

The paper proposes a method to create robust neural networks for automated driving.

problem Creating neural networks that can accurately predict road conditions and distances.
method The method introduces a non-standard loss function with tolerance to account for label variability and allows for deviations from labels.
result The proposed method results in a neural network that can robustly predict road conditions and distances, even with small label variations.

Improves matrix multiplication throughput for asymmetric bit-width operands.

problem Matrix multiplications between asymmetric bit-width operands, especially 8- and 4-bit, are not efficiently handled by existing SIMD instructions.
method Proposes a new SIMD matrix multiplication instruction that uses mixed precision on inputs (8- and 4-bit) and accumulates into 16-bit output, improving throughput.
result Offers 2x improvement in throughput compared to existing symmetric-operand-size instructions, with negligible overflow.

Novel algorithm for privacy-preserving distributed learning in analog domain.

problem Privacy-preserving distributed learning over analog data.
method Proposes a novel algorithm for analog data, leveraging real/complex number representation and information-theoretic security metrics.
result Demonstrates a fundamental trade-off between privacy and accuracy in analog domain distributed learning.