LUTNet optimizes FPGA neural network accelerators by leveraging LUTs for inference, achieving significant area savings.
problem Redundancy in deep neural networks and inefficient use of FPGA resources.
method End-to-end hardware-software framework using LUTs to implement any K-input Boolean operation for inference.
result Significant area savings and comparable accuracy compared to state-of-the-art binarized neural networks.
LUTNet optimizes FPGA for neural network inference, achieving high efficiency.
problem Redundancy in neural networks leads to inefficient hardware implementations.
method Exploits LUTs' flexibility for efficient neural network inference on FPGAs.
result Significant area savings with comparable accuracy compared to state-of-the-art binarized neural networks.
PriorVAE uses VAEs to efficiently encode spatial priors for small-area estimation.
problem Efficiently encoding spatial priors for small-area estimation using Gaussian processes.
method Approximating Gaussian process priors with a variational autoencoder (VAE).
result Efficient spatial inference through a low-dimensional latent Gaussian space representation.
We study polygonal analogues of several moving boundary problems and their time discretization which preserves the constant area speed property. We establish various polygonal analogues of geometric formulas for moving boundaries and make use of the geometric formulas for our numerical scheme and its analysis of genera…
We provide an efficient algorithm to compute the minimum area of a homotopy between two closed plane curves, given that they divide the plane into finite number of regions. For any positive real number ε>0, we construct a closed plane curve γ such that the minimum area of a null homotopy of 2⋅γ is l…
Algorithm estimates Gaussian parameters under unknown truncation sets.
problem Estimating Gaussian parameters when samples are truncated to unknown sets.
method Efficient algorithm for arbitrary unknown truncation sets, using Gaussian surface area as complexity measure.
result Algorithm works for large families of sets including intersections of halfspaces and general convex sets.
A DRL-based strategy improves vehicle tracking accuracy while saving energy.
problem Enhancing vehicle tracking accuracy in WSNs without increasing energy consumption.
method Decentralized strategy with dynamic reinforcement learning to adjust sensing areas.
result Simulation results demonstrate superior performance of DRL-aided design.
This paper proposes a submodular load clustering method for transmission-level load areas.
problem Traditional load analysis challenges with new electricity usage patterns.
method Robust Principal Component Analysis (R-PCA) and submodular cluster center selection.
result The proposed method efficiently clusters load areas and demonstrates effectiveness in PJM load data.
JAPAN uses flow-based models to create adaptive prediction areas with better coverage guarantees.
problem Inadequate prediction areas from existing conformal prediction methods, especially for multimodal distributions.
method JAPAN employs density-based conformity scores using flow-based models to construct context-adaptive prediction areas.
result JAPAN produces more accurate and context-adaptive prediction areas compared to existing methods.
A simpler edge-based discretization method without dual volumes.
problem Efficiently computing edge-based discretization vectors without forming dual volumes.
method Directly compute edge-midpoint vectors and reduce dual volume formation.
result Significant reduction in computing time for tetrahedral grids.
STMT predicts compounds in unknown areas with trend reflection.
problem Predicting properties of unknown compounds in the extrapolation area.
method Stochastic Threshold Model Trees (STMT) that reflects data trends.
result STMT improves prediction accuracy for one compound in the extrapolation area.
FixyNN improves energy efficiency of mobile computer vision tasks.
problem High energy consumption of state-of-the-art CNN models on mobile devices.
method Fixed-weight feature extractor and programmable CNN accelerator for transfer learning.
result Achieved up to 26.6 TOPS/W energy efficiency, nearly 2x more efficient than conventional accelerators.
Ball k-means reduces point-centroid distance computations for faster k-means clustering.
problem Efficiently finding k-means clusters in large datasets.
method Uses a ball to describe clusters, dividing them into stable and active areas, and adjusting points within annulus areas.
result Significantly reduces point-centroid distance computations, making k-means faster and more efficient.
New algorithm optimizes AUC in binary classification and changepoint detection.
problem Difficult to optimize AUC in binary classification and changepoint detection.
method Proposes efficient path-following algorithms for choosing optimal learning rate.
result Proposed line search algorithm computes complete AUM/AUC representation.
Efficiently tests machine learning models with minimal labeled data.
problem Guaranteeing the performance of machine learning models and preventing failures.
method Proposes a novel framework using Bayesian neural networks and data augmentation for efficient testing.
result Metrics estimations by the proposed method are significantly better than existing baselines.
CRL uses clustering to enhance exploration in RL, improving performance in diverse tasks.
problem Challenges in RL with large state spaces and sparse rewards.
method CRL employs clustering to guide exploration based on novelty and quality in neighboring areas.
result CRL outperforms other methods in various RL tasks.
This survey analyzes deep learning methods for real-time semantic image segmentation.
problem Efficient and accurate semantic image segmentation for real-time applications.
method Comprehensive analysis of deep learning architectures and techniques for fast inference.
result Best-performing architectures and techniques for real-time semantic image segmentation.
Enhances interpolation paths in latent space using particle filters.
problem Generating meaningful interpolations between data points in latent space.
method Introduces a discriminator network to guide particle filter sampling of interpolation paths.
result Improved variability and stronger drift towards high data density areas.
Handling the tremendous amount of network data, produced by the explosive growth of mobile traffic volume, is becoming of main priority to achieve desired performance targets efficiently. Opportunistic communication such as FloatingContent (FC), can be used to offload part of the cellular traffic volume to vehicular-to…
Transformed geometry into algebra to prove Pick's theorem efficiently.
problem Translating geometric Pick's theorem into formal algebraic proof.
method Formalized geometric Pick's theorem into algebraic proof using Lean.
result Efficient formal proof of Pick's theorem.
A new method improves RVFL networks for resource-efficient machine learning.
problem Deploying machine learning on edge devices with limited resources.
method Density encoding and hyperdimensional computing operations.
result The proposed method achieves higher accuracy and lower energy consumption.
GOBO compresses 99.9% of BERT model parameters to 3 bits, improving inference efficiency.
problem Efficient execution of attention-based NLP models, especially in terms of latency and energy consumption.
method GOBO quantizes 32-bit floating-point parameters to 3 bits without fine-tuning, using hardware compression and co-designed architectures.
result GOBO maintains model accuracy while significantly reducing inference latency and energy consumption.
VAD uses efficient inference to learn from incomplete data.
problem Learning generative models from partial data.
method Variational Auto-Decoder framework using Variational Bayes and MCMC methods.
result VAD reduces inference computational cost and allows for more complex optimization.
Paper proposes efficient multivariate spatial Fay-Herriot models using variational autoencoders.
problem Estimating population characteristics in small areas with limited data.
method Integrates multivariate spatial Fay-Herriot model with variational autoencoders to leverage spatial structure efficiently.
result Significant computational efficiency improvements for high-dimensional datasets.
Survey of robust statistical methods for efficient computation.
problem Efficient robust statistical methods for various forms of data contamination and heavy-tailed distributions.
method Survey and technical connections between robustness forms, showing efficient algorithms.
result Same algorithmic ideas lead to efficient estimators for robustness in different settings.
New method improves efficiency analysis with big data.
problem Challenges in detecting inefficiency with big data.
method Post Double LASSO method using Neyman orthogonal moment conditions.
result Improved estimation of efficiency and inefficiency.
Quantum-assisted VAE improves similarity search in high-dimensional datasets.
problem Finding fast and memory-efficient similarity search in high-dimensional data.
method Construct a space-efficient search index based on the latent space of a Quantum-assisted Variational Autoencoder (QVAE).
result Real-world speedups and memory-efficient scaling to half a billion data points.
This paper uses RL for better financial trading.
problem Improving financial trading algorithms.
method Deep Q Learning applied to quantitative trading.
result RL can outperform traditional trading algorithms.
Bayesian optimization with directionally constrained search improves efficiency within a budget.
problem Optimizing expensive functions with limited computational resources.
method Directionally constrained search to allocate model capability efficiently.
result Our approach outperforms in finding the optimum within a prescribed evaluation budget.
Project predicts stock prices for robust portfolio design in Indian sectors.
problem Precise stock price prediction for robust portfolio design.
method Minimum variance and optimal risk portfolio optimization using past stock prices.
result Backtesting shows improved performance of optimized portfolios over equal weight portfolio.
Bit-slice sparsity improves ReRAM-based DNN acceleration.
problem Limited ADC power and area constraints in ReRAM-based DNN accelerators.
method Proposed bit-slice L1 algorithm to induce sparsity during training.
result 2x sparsity improvement compared to previous methods.
NeuroPaint infers missing brain area dynamics from multi-animal datasets.
problem Leveraging multi-animal datasets to understand interactions between brain areas.
method Masked autoencoding approach trained across animals with partial observations.
result Models can successfully reconstruct dynamics of unrecorded brain areas.
Extracting information from functional magnetic resonance (fMRI) images has been a major area of research for more than two decades. The goal of this work is to present a new method for the analysis of fMRI data sets, that is capable to incorporate a priori available information, via an efficient optimization framework…
In this paper, we introduce the Lp geominimal surface area for all −n=p<1, which extends the classical geominimal surface area (p=1) by Petty and the Lp geominimal surface area by Lutwak (p>1). Our extension of the Lp geominimal surface area is motivated by recent work on the extension of the Lp a…
Confidence intervals are a popular way to visualize and analyze data distributions. Unlike p-values, they can convey information both about statistical significance as well as effect size. However, very little work exists on applying confidence intervals to multivariate data. In this paper we define confidence interval…
Overview of affine surface area and its history.
problem None explicitly stated; focuses on overview.
method None explicitly stated; focuses on overview.
result None explicitly stated; focuses on overview.
Formulates approach for guiding explanation types based on user specifications.
problem Creating explainable AI components from user-defined specifications.
method Develops a method for generating explanations based on user-defined specifications.
result Demonstrates feasibility of user-defined explanations for complex models like Bayesian networks and graph neural networks.
Study removes singularities from area-minimizing surfaces.
problem Removal of singularities from area-minimizing surfaces.
method Extending results on area-minimizing cones to handle isolated singularities.
result Isolated singularities can be locally perturbed away on the minimizing side.
Hasse principle applied to area-minimizing submanifolds across different homology types.
problem Understanding the behavior of area-minimizing submanifolds in various homology contexts.
method Extending the Hasse principle from number theory to geometric variational problems.
result Recovering information about area-minimizing submanifolds in integral homology from those in real and mod n homology. Two new coding schemes improve the efficient communication of noisy data.
problem Efficient communication of noisy data in machine learning.
method Ordered Random Coding (ORC) and Hybrid Coding Scheme.
result Improved coding schemes over existing approaches.
Two families of general affine surface areas are introduced. Basic properties and affine isoperimetric inequalities for these new affine surface areas as well as for Lφ affine surface areas are established.
Appropriate traffic regulations, e.g. planned road closure, are important in congested events. Crowd simulators have been used to find appropriate regulations by simulating multiple scenarios with different regulations. However, this approach requires multiple simulation runs, which are time-consuming. In this paper, w…
Paper presents a WiFi-based indoor sensor localization technique.
problem Indoor localization in wireless sensor networks.
method Zoning-based localization using statistical learning.
result Efficient sensor zone determination in indoor environments.
Bayesian tensor network reduces conditional probability calculation to polynomial time.
problem Exponential cost of calculating conditional probabilities for multiple events.
method Bayesian tensor network (BTN) with polynomial complexity.
result Competitive performance in image recognition with simple tree structures.
The efficiency of deep machine learning for automatic delineation of tumor areas has been demonstrated for intraoperative neuronavigation using active IR-mapping with the use of the cold test. The proposed approach employs a matrix IR-imager to remotely register the space-time distribution of surface temperature patter…
The hermitian analog of Aleksandrov's area measures of convex bodies is investigated. A characterization of those area measures which arise as the first variation of unitarily invariant valuations is established. General smooth area measures are shown to form a module over smooth valuations and the module of unitarily …
Preference learning (PL) is a core area of machine learning that handles datasets with ordinal relations. As the number of generated data of ordinal nature is increasing, the importance and role of the PL field becomes central within machine learning research and practice. This paper introduces an open source, scalable…
The problem of active diagnosis arises in several applications such as disease diagnosis, and fault diagnosis in computer networks, where the goal is to rapidly identify the binary states of a set of objects (e.g., faulty or working) by sequentially selecting, and observing, (noisy) responses to binary valued queries. …