Search Results for author:
Found 19 papers, 11 papers with code
Superior Computer Chess with Model Predictive Control, Reinforcement Learning, and Rollout
Structurally, our basic architecture selects moves by a one-move lookahead search, with an intermediate move generated by a nominal opponent engine, and followed by a position evaluation by another chess engine.
Distributed Charging Coordination for Electric Trucks under Limited Facilities and Travel Uncertainties
The truck then receives the estimated waiting times from these stations in response, and updates its charging plan accordingly while accounting for travel uncertainties.
An Approximate Dynamic Programming Framework for Occlusion-Robust Multi-Object Tracking
When tested on the MOT17 video dataset, the proposed method demonstrates a 0. 7% improvement in the association accuracy (IDF1 metric) over a state-of-the-art method that is used as the base heuristic.
Most Likely Sequence Generation for $n$-Grams, Transformers, HMMs, and Markov Chains, by Using Rollout Algorithms
We consider methods for computing word sequences that are highly likely, based on these probabilities.
Distributed Charging Coordination of Electric Trucks with Limited Charging Resources
Electric trucks usually need to charge their batteries during long-range delivery missions, and the charging times are often nontrivial.
Flash-LLM: Enabling Cost-Effective and Highly-Efficient Large Generative Model Inference with Unstructured Sparsity
Therefore, we propose Flash-LLM for enabling low-cost and highly-efficient large generative model inference with the sophisticated support of unstructured sparsity on high-performance but highly restrictive Tensor Cores.
Rollout-Based Charging Strategy for Electric Trucks with Hours-of-Service Regulations (Extended Version)
We assume that a collection of charging and rest stations is given along a pre-planned route with known detours and that the problem data are deterministic.
Automatic Network Pruning via Hilbert-Schmidt Independence Criterion Lasso under Information Bottleneck Principle
In this paper, we try to solve this problem by introducing a principled and unified framework based on Information Bottleneck (IB) theory, which further guides us to an automatic pruning approach.
Parameter-Efficient Sparsity for Large Language Models Fine-Tuning
With the dramatically increased number of parameters in language models, sparsity methods have received ever-increasing research focus to compress and accelerate the models.
An Information Theory-inspired Strategy for Automatic Network Pruning
This practically limits the application of model compression when the model needs to be deployed on a wide range of devices.
You Only Compress Once: Towards Effective and Elastic BERT Compression via Exploit-Explore Stochastic Nature Gradient
Motivated by the necessity of efficient inference across various constraints on BERT, we propose a novel approach, YOCO-BERT, to achieve compress once and deploy everywhere.
1xN Pattern for Pruning Convolutional Neural Networks
We also provide a workflow of filter rearrangement that first rearranges the weight matrix in the output channel dimension to derive more influential blocks for accuracy improvements and then applies similar rearrangement to the next-layer weights in the input channel dimension to ensure correct convolutional operations.
Towards Compact CNNs via Collaborative Compression
Channel pruning and tensor decomposition have received extensive attention in convolutional neural network compression.
PAMS: Quantized Super-Resolution via Parameterized Max Scale
Specifically, most state-of-the-art SR models without batch normalization have a large dynamic quantization range, which also serves as another cause of performance drop.
INT8 Winograd Acceleration for Conv1D Equipped ASR Models Deployed on Mobile Devices
The intensive computation of Automatic Speech Recognition (ASR) models obstructs them from being deployed on mobile devices.
Automatic Speech Recognition
Automatic Speech Recognition (ASR)
+2
Lambda-Policy Iteration with Randomization for Contractive Models with Infinite Policies: Well-Posedness and Convergence
The operator is known to be well-posed for problems with finite states, but our analysis shows that it is also well-defined for the contractive models with infinite states studied.
Interpretable Neural Network Decoupling
More specifically, we introduce a novel architecture controlling module in each layer to encode the network architecture by a vector.
Towards Compact ConvNets via Structure-Sparsity Regularized Filter Pruning
In this paper, we propose a novel filter pruning scheme, termed structured sparsity regularization (SSR), to simultaneously speedup the computation and reduce the memory overhead of CNNs, which can be well supported by various off-the-shelf deep learning libraries.
Exploiting Kernel Sparsity and Entropy for Interpretable CNN Compression
The relationship between the input feature maps and 2D kernels is revealed in a theoretical framework, based on which a kernel sparsity and entropy (KSE) indicator is proposed to quantitate the feature map importance in a feature-agnostic manner to guide model compression.
