Deep neural networks show great potential as solutions to many sensing application problems, but their excessive resource demand slows down execution time, pausing a serious impediment to deployment on low-end devices. To address this challenge, recent literature focused on compressing neural network size to improve pe…
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,695 papers · 148 categories
Trend · papers per month
48 results for “neural execution”
Neural execution solves complex graph problems like bipartite matching.
problem Solving complex graph algorithms like maximum bipartite matching.
method Reduces bipartite matching to a flow problem and uses Ford-Fulkerson for maximum flow.
result Neural network achieves optimal matching almost 100% of the time.
Dynamic VWAP execution improves by 10-15% in liquid markets.
problem Improving VWAP execution in dynamic markets.
method Recurrent Neural Networks (RNNs) for capturing temporal market dynamics, dynamic adjustment mechanism.
result Significant performance gains in liquid markets (10-15%) over traditional methods.
LEMs extend transformer-based architectures for complex execution problems.
problem Handling flexible time boundaries and multiple execution constraints in deep learning.
method Decouples market information processing from execution allocation decisions using TKANs, VSNs, and multi-head attention mechanisms.
result LEMs achieve superior execution performance compared to traditional benchmarks.
ICON-OCnet solves optimal execution problems with neural networks and few examples.
problem Optimal order execution in markets with unknown price impact.
method Transformer-based neural network architecture (ICON-OCnet) that learns price impact from few examples and applies it to optimal execution strategies.
result ICON-OCnet accurately infers price impact models and retrieves optimal execution strategies for various propagator kernels.
We introduce Dynamic Deep Neural Networks (D2NN), a new type of feed-forward deep neural network that allows selective execution. Given an input, only a subset of D2NN neurons are executed, and the particular subset is determined by the D2NN itself. By pruning unnecessary computation depending on input, D2NNs provide a…
SED integrates synthesis, execution, and debugging for neural program synthesis.
problem Challenges in synthesizing complex programs that match specifications.
method SED combines synthesis, execution, and debugging to improve neural program generation.
result SED reduces error rates and outperforms standard decoding methods.
Generalist neural learner can execute multiple algorithms.
problem Building models that can execute multiple algorithms.
method Single graph neural network processor, incorporating knowledge from specialist models.
result Generalist learner can execute multiple algorithms with improved performance.
This paper optimizes SMPC for neural network inference, reducing memory and time.
problem Memory and time constraints in secure neural network inference.
method Implemented ABY2.0 protocol, optimized memory usage, and used a helper node.
result MNIST inference reduced from 8.03 GB RAM and 200s to 0.2 GB RAM and 32s.
NeSS combines neural and symbolic approaches for better compositional generalization.
problem Lack of compositional generalization in deep learning models.
method NeSS uses a neural network to generate traces, executed by a symbolic stack machine with sequence manipulation.
result Achieves 100% generalization performance across multiple domains.
Chameleon optimizes neural network compilation for faster execution and shorter time.
problem Faster execution and shorter compilation time for neural networks.
method Adaptive code optimization using reinforcement learning and adaptive sampling.
result 4.45x speed up in optimization time over AutoTVM, 5.6% improvement in inference time.
Combines dynamic programming and neural networks for optimal portfolio execution in regime-switching markets.
problem Optimal execution in a market with multiple regimes and non-linear impact costs.
method Four-step numerical framework: approximated orthogonal portfolios, dynamic program for schedule, neural network optimization.
result Neural network optimized strategy outperforms traditional methods in both CRRA and mean-variance objectives.
DarkneTZ protects edge devices from DNN model leaks using TEE and model partitioning.
problem Privacy risks of pre-trained DNNs on edge devices through membership inference attacks.
method Model partitioning into sensitive and untrusted parts, leveraging TEE.
result DarkneTZ provides reliable model privacy with minimal performance overhead.
DANCE optimizes neural network and accelerator design for faster, more efficient DNN execution.
problem Challenges in optimizing neural network and accelerator design for efficient DNN execution.
method Differentiable approach to co-exploration of accelerator and network architecture design.
result Significantly shorter time to achieve superior accuracy and hardware cost metrics.
Sequence-to-sequence models predict resource usage for co-scheduled jobs in data centers.
problem Challenges in co-scheduling jobs due to resource interference and inefficiencies.
method Sequence-to-sequence models based on recurrent neural networks for workload interference prediction.
result Models accurately forecast resource usage trends from job profiles, improving scheduling decisions.
Recursive neural networks have widely been used by researchers to handle applications with recursively or hierarchically structured data. However, embedded control flow deep learning frameworks such as TensorFlow, Theano, Caffe2, and MXNet fail to efficiently represent and execute such neural networks, due to lack of s…
Concolic testing combines program execution and symbolic analysis to explore the execution paths of a software program. This paper presents the first concolic testing approach for Deep Neural Networks (DNNs). More specifically, we formalise coverage criteria for DNNs that have been studied in the literature, and then d…
Optimizes large stock order execution with LSTM neural networks.
problem Minimizing transaction costs in large stock order execution.
method Trained LSTM neural network to minimize transaction costs.
result LSTM strategy outperforms TWAP and VWAP strategies.
Severe constraints on memory and computation characterizing the Internet-of-Things (IoT) units may prevent the execution of Deep Learning (DL)-based solutions, which typically demand large memory and high processing load. In order to support a real-time execution of the considered DL model at the IoT unit level, DL sol…
Researchers analyze and improve latent space in NAR models.
problem Latent space resolution and range issues in NAR models.
method Detailed analysis of GNN latent space structure, proposing and testing solutions.
result Improvements in majority of algorithms on CLRS-30 benchmark.
Neural Module Networks, originally proposed for the task of visual question answering, are a class of neural network architectures that involve human-specified neural modules, each designed for a specific form of reasoning. In current formulations of such networks only the parameters of the neural modules and/or the or…
This paper introduces a high frequency trade execution model to evaluate the economic impact of supervised machine learners. Extending the concept of a confusion matrix, we present a 'trade information matrix' to attribute the expected profit and loss of the high frequency strategy under execution constraints, such as …
As the performance of computer systems stagnates due to the end of Moore's Law, there is a need for new models that can understand and optimize the execution of general purpose code. While there is a growing body of work on using Graph Neural Networks (GNNs) to learn representations of source code, these representation…
Trains a neural network to predict high-frequency trading outcomes.
problem Predicting the fill probability function for high-frequency trading.
method High-quality high-frequency data and neural network training with a weighted loss function.
result Strong state dependence properties of the fill probability function.
As Machine Learning (ML) gets applied to security-critical or sensitive domains, there is a growing need for integrity and privacy for outsourced ML computations. A pragmatic solution comes from Trusted Execution Environments (TEEs), which use hardware and software protections to isolate sensitive computations from the…
With the rapid emergence of a spectrum of high-end mobile devices, many applications that required desktop-level computation capability formerly can now run on these devices without any problem. However, without a careful optimization, executing Deep Neural Networks (a key building block of the real-time video stream p…
Knowledge-Driven Modulation of Neural Networks with Attention Mechanism for Next Activity Predictioncs.AI
The paper improves neural network predictions by integrating process knowledge.
problem Improving neural network predictions for process execution data.
method Integrates background process knowledge into neural networks with attention mechanisms.
result Improves prediction accuracy for process execution data.
We address the problem of reverse engineering of stripped executables, which contain no debug information. This is a challenging problem because of the low amount of syntactic information available in stripped executables, and the diverse assembly code patterns arising from compiler optimizations. We present a novel ap…
Existing methods for reducing the computational burden of neural networks at run-time, such as parameter pruning or dynamic computational path selection, focus solely on improving computational efficiency during inference. On the other hand, in this work, we propose a novel method which reduces the memory footprint and…
Optimal trade execution is an important problem faced by essentially all traders. Much research into optimal execution uses stringent model assumptions and applies continuous time stochastic control to solve them. Here, we instead take a model free approach and develop a variation of Deep Q-Learning to estimate the opt…
New technique reduces memory usage and boosts neural network training speed.
problem Training large neural networks requires significant memory and computational resources.
method L2L (layer-to-layer) execution technique with eager param-server (EPS) and micro-batching.
result 45% reduction in memory usage and 40% increase in throughput for BERT-Large.
Graph neural network executes value iteration for flexible environments.
problem Value iteration in flexible environments with direct supervision.
method Graph Neural Network (GNN) executing value iteration algorithm.
result GNN accurately models value iteration across diverse environments.
Optimizing the execution time of tensor program, e.g., a convolution, involves finding its optimal configuration. Searching the configuration space exhaustively is typically infeasible in practice. In line with recent research using TVM, we propose to learn a surrogate model to overcome this issue. The model is trained…
A new VWAP execution method using transformer and signature features.
problem Asset-specific model training and complex temporal dependencies.
method Combining transformer-based design with path signatures for capturing geometric features.
result GFT-Sig model achieves superior performance in VWAP loss metrics.
This work optimizes DNN inference for energy-harvesting devices by compressing and selectively executing neural network exits.
problem Inference delays and energy inefficiency in energy-harvesting devices.
method Developed a power trace-aware and exit-guided network compression algorithm for multi-exit neural networks.
result Superior accuracy and reduced latency compared to state-of-the-art techniques.
Study compares LSTM and ANN architectures for forex prediction, finding ANN more efficient.
problem Forex time series prediction efficiency and resource usage.
method Comparison of Long Short-Term Memory (LSTM) and specialized ANN architectures.
result Specialized ANN architecture performs better with fewer resources and faster execution.
Convolutional Neural Networks (CNNs) are extremely computationally demanding, presenting a large barrier to their deployment on resource-constrained devices. Since such systems are where some of their most useful applications lie (e.g. obstacle detection for mobile robots, vision-based medical assistive technology), si…
CLEANN detects and mitigates neural network Trojans without labeled data.
problem Trojans in embedded neural networks that bypass detection during inference.
method Dictionary learning and sparse approximation for identifying Trojan triggers, lightweight algorithm/hardware co-design.
result Efficient real-time execution on resource-constrained platforms, competitive attack resiliency.
Self-referential meta learning avoids explicit optimization by modifying itself.
problem Dependency on human engineering in meta learning algorithms.
method Investigates self-referential meta learning systems that modify themselves without explicit optimization.
result Self-referential neural networks can improve their own modifications without explicit optimization.
Speeds up deep neural networks training by 10x using GPU concurrency.
problem Training deep residual neural networks efficiently.
method Layer-wise parallel training with GPU concurrency and Nonlinear Multigrid.
result 10.2x speedup over traditional techniques.
XLVINs improve deep reinforcement learning by combining self-supervised learning and neural algorithmic reasoning.
problem Limitations of Value Iteration Networks (VINs) in deep reinforcement learning.
method Combining contrastive self-supervised learning, graph representation learning, and neural algorithmic reasoning.
result XLVINs match VIN-like models on discrete, fixed MDPs and significantly outperform model-free baselines.
Executing deep neural networks for inference on the server-class or cloud backend based on data generated at the edge of Internet of Things is desirable due primarily to the limited compute power of edge devices and the need to protect the confidentiality of the inference neural networks. However, such a remote inferen…
Achieving faster execution with shorter compilation time can enable further diversity and innovation in neural networks. However, the current paradigm of executing neural networks either relies on hand-optimized libraries, traditional compilation heuristics, or very recently, simulated annealing and genetic algorithms.…
One-shot path planning for multiple agents using neural networks.
problem Efficiently generating optimal or near-optimal paths for multiple agents in robotics.
method Utilizes fully convolutional neural networks for one-shot multi-agent path planning.
result Demonstrates successful generation of optimal or near-optimal paths in over 85% of cases for multi-path planning.
Paper uses RL to optimize trading in time-varying liquidity markets.
problem Optimal execution in dynamic liquidity markets.
method Double Deep Q-learning for neural networks.
result Trained RL algorithm learns optimal trading policies in time-varying liquidity.
Serenity optimizes neural network execution for edge devices by scheduling with optimal memory footprint.
problem Order of nodes in irregular neural networks affects memory footprint, complicating execution under resource constraints.
method Memory-aware compiler using dynamic programming and graph rewriting to find optimal schedules.
result Achieves optimal peak memory and further improves it with graph rewriting, reducing memory usage by 1.68x-1.86x compared to TensorFlow Lite.
Proposes a method to allocate time budgets in mixed criticality systems.
problem Managing execution time variability in mixed criticality systems.
method Quantifies execution time variability using statistical dispersion parameters and proposes a heuristic to allocate time budgets.
result The proposed heuristic reduces the probability of exceeding allocated budgets.
Optimal crypto order execution using cross-exchange signals.
problem Maximizing order execution efficiency in cryptocurrency markets.
method Reinforcement learning applied to cross-exchange data.
result Cross-exchange signals improve optimal execution outcomes.