Given the ability to directly manipulate image pixels in the digital input space, an adversary can easily generate imperceptible perturbations to fool a Deep Neural Network (DNN) image classifier, as demonstrated in prior work. In this work, we propose ShapeShifter, an attack that tackles the more challenging problem o…
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 “Faster R-CNN”
Recent object detectors use four-coordinate bounding box (bbox) regression to predict object locations. Providing additional information indicating the object positions and coordinates will improve detection performance. Thus, we propose two types of masks: a bbox mask and a bounding shape (bshape) mask, to represent t…
ImageNet pre-training has been regarded as essential for training accurate object detectors for a long time. Recently, it has been shown that object detectors trained from randomly initialized weights can be on par with those fine-tuned from ImageNet pre-trained models. However, the effects of pre-training and the diff…
New methods detect objects in industrial settings with little training data.
problem Lack of training data limits object detection in industrial settings.
method Adapted Faster R-CNN and Scaled Yolov4-p5 architectures for small training data.
result Both models can distinguish unknown objects from homogeneous backgrounds.
Automated pavement distresses detection using road images remains a challenging topic in the computer vision research community. Recent developments in deep learning has led to considerable research activity directed towards improving the efficacy of automated pavement distress identification and rating. Deep learning …
Deep Learning detects cyclists' orientation for safer roads.
problem Ensuring safety for cyclists in intelligent transportation systems.
method Transfer Learning with pre-trained models, multi-class detection, new dataset creation.
result Faster R-CNN with ResNet50 proved precise but slower; SSD with InceptionV2 provided good trade-off.
Deep feature fusion improves mitosis counting accuracy.
problem Manual mitosis counting by pathologists is time-consuming and inconsistent.
method Combines Faster R-CNN for object detection with UNet segmentation features and RGB image features.
result Achieved an F-score of 0.508 on mitosis counting challenge dataset, outperforming state-of-the-art methods.
This project applies Mask R-CNN method to ISIC 2018 challenge tasks: lesion boundary segmentation (task1), lesion attributes detection (task 2), lesion diagnosis (task 3), a solution to the latter is using a trained model for task 1 and a simple voting procedure.
Federated learning is a new machine learning paradigm which allows data parties to build machine learning models collaboratively while keeping their data secure and private. While research efforts on federated learning have been growing tremendously in the past two years, most existing works still depend on pre-existin…
Improved breast cancer screening with a fast, memory-efficient model.
problem Classifying high-resolution breast cancer screening images.
method Extends globally-aware multiple instance classifier to handle image-level labels.
result Achieves AUC of 0.93 in classifying malignant findings, outperforming existing methods.
Study automates detection of visitation disruptions in ICU patients.
problem Difficulty in detecting frequent visitation disruptions in ICU patients.
method Used DensePose R-CNN model to count people in video frames, analyzed disruptions and patient outcomes.
result Automated method detects visitation disruptions, impacts on pain and length of stay examined.
Generative models create indistinguishable adversarial objects for object detection.
problem Creating unrestricted adversarial examples for object detection.
method Search over latent space of GAN for adversarial objects.
result Generated adversarial objects are indistinguishable from non-adversarial objects and transferable.
Few ideas have enjoyed as large an impact on deep learning as convolution. For any problem involving pixels or spatial representations, common intuition holds that convolutional neural networks may be appropriate. In this paper we show a striking counterexample to this intuition via the seemingly trivial coordinate tra…
The Huber loss is a robust loss function used for a wide range of regression tasks. To utilize the Huber loss, a parameter that controls the transitions from a quadratic function to an absolute value function needs to be selected. We believe the standard probabilistic interpretation that relates the Huber loss to the H…
Deep object detection improves mitotic nucleus detection in breast cancer biopsies.
problem Challenges in automated mitotic nucleus detection in breast cancer histopathological images.
method Adapted Mask R-CNN for deep object detection, initially selects candidate regions with maximum recall, refines them with multi-object loss function.
result Improved discrimination ability (F-score of 0.86) and significant precision (0.86) for mitotic nuclei compared to two-stage models.
Hybrid AI and rule-based framework de-identifies medical imaging data.
problem De-identifying medical imaging data to protect PHI and PII.
method Combines rule-based and AI techniques with uncertainty quantification.
result Robust performance across benchmark datasets and regulatory standards.
We study the problem of object detection over scanned images of scientific documents. We consider images that contain objects of varying aspect ratios and sizes and range from coarse elements such as tables and figures to fine elements such as equations and section headers. We find that current object detectors fail to…
Enhances image captioning with novel context combination methods.
problem Improving machine learning for image captioning with structured learning and meaningful interpretation.
method Combines Feature Distribution Composition (FDC), Multiple Role Representation Crossover (MRRC) attention layers, and language decoder.
result Significantly improved image captioning performance (35.3%) and established new standards.
Automatically designs normalization and activation layers together.
problem Designing normalization and activation layers separately.
method Unified tensor-to-tensor computation graph, low-level mathematical functions, rejection protocols, multi-objective evolution.
result Discovery of EvoNorms with novel structures.
Deep learning methods are useful for high-dimensional data and are becoming widely used in many areas of software engineering. Deep learners utilizes extensive computational power and can take a long time to train-- making it difficult to widely validate and repeat and improve their results. Further, they are not the b…
Scalable algorithms to solve optimization and regression tasks even approximately, are needed to work with large datasets. In this paper we study efficient techniques from matrix sketching to solve a variety of convex constrained regression problems. We adopt "Iterative Hessian Sketching" (IHS) and show that the fast C…
Recent advances in optimization theory have shown that smooth strongly convex finite sums can be minimized faster than by treating them as a black box "batch" problem. In this work we introduce a new method in this class with a theoretical convergence rate four times faster than existing methods, for sums with sufficie…
Matrix completion is a widely used technique for image inpainting and personalized recommender system, etc. In this work, we focus on accelerating the matrix completion using faster randomized singular value decomposition (rSVD). Firstly, two fast randomized algorithms (rSVD-PI and rSVD- BKI) are proposed for handling …
New method reduces inference variance for faster optimization.
problem High variance in black-box variational inference.
method Joint control variate addressing both data subsampling and Monte Carlo noise.
result Significantly reduced gradient variance, leading to faster optimization.
The time complexity of support vector machines (SVMs) prohibits training on huge data sets with millions of data points. Recently, multilevel approaches to train SVMs have been developed to allow for time-efficient training on huge data sets. While regular SVMs perform the entire training in one -- time consuming -- op…
Nesterov's accelerated gradient descent (AGD), an instance of the general family of "momentum methods", provably achieves faster convergence rate than gradient descent (GD) in the convex setting. However, whether these methods are superior to GD in the nonconvex setting remains open. This paper studies a simple variant…
New machine learning model faster, more accurate, and can identify hard-to-classify samples.
problem Improving classification models in machine learning.
method Quadratic Multiform Separation approach.
result Produces comparable predictive accuracy, runs faster, and identifies hard-to-classify samples.
Exploiting sparsity enables hardware systems to run neural networks faster and more energy-efficiently. However, most prior sparsity-centric optimization techniques only accelerate the forward pass of neural networks and usually require an even longer training process with iterative pruning and retraining. We observe t…
We propose a novel technique for faster deep neural network training which systematically applies sample-based approximation to the constituent tensor operations, i.e., matrix multiplications and convolutions. We introduce new sampling techniques, study their theoretical properties, and prove that they provide the same…
FIRE PBT improves neural network training by focusing on long-term performance.
problem Greedy decision mechanisms in PBT lead to poor long-term performance.
method FIRE PBT uses a fitness metric to encourage long-term performance over short-term improvements.
result FIRE PBT outperforms PBT on ImageNet and matches hand-tuned learning rates.
A faster algorithm for ranking from pairwise comparisons.
problem Efficiently ranking individuals or objects from pairwise comparisons.
method An alternative and simpler iterative algorithm for ranking that converges faster.
result The new algorithm is over 100 times faster in some cases.
Deeper neural networks learn lower frequency functions faster, according to a new principle.
problem Understanding why deeper learning is faster.
method Fourier analysis and filtering method to separate and analyze the frequency distribution of neural network outputs.
result Deeper hidden layers in neural networks bias towards lower frequency functions during training.
Paper proposes faster method to find local minima in nonconvex optimization.
problem Escaping saddle points and finding local minima in nonconvex optimization.
method LENA (Last stEp shriNkAge) framework for faster perturbed stochastic gradient methods.
result LENA finds -approximate local minima within evaluations.
Faster training of neural ODEs using Gauß-Legendre quadrature.
problem Training neural ODEs is slow due to solving ODEs numerically.
method Use Gauß-Legendre quadrature to solve integrals faster than ODE-based methods.
result Faster training of neural ODEs, especially for large models.
In this paper, we present the Bennett-type generalization bounds of the learning process for i.i.d. samples, and then show that the generalization bounds have a faster rate of convergence than the traditional results. In particular, we first develop two types of Bennett-type deviation inequality for the i.i.d. learning…
We present a unified framework for low-rank matrix estimation with nonconvex penalties. We first prove that the proposed estimator attains a faster statistical rate than the traditional low-rank matrix estimator with nuclear norm penalty. Moreover, we rigorously show that under a certain condition on the magnitude of t…
Faster Tsetlin Machines use clause indexing to speed inference and learning.
problem Overfitting and slow inference in Tsetlin Machines.
method Introduced a look-up table that indexes clauses based on feature falsification, enabling faster evaluation of clauses.
result Up to 15 times faster classification and three times faster learning on MNIST and Fashion-MNIST.
This is our second paper in a series to study gravitational instantons, i.e. complete hyperkäler 4-manifolds with faster than quadratic curvature decay. We prove two main theorems: 1.The asymptotic rate of gravitational instantons to the standard models can be improved automatically. 2.Any ALF-D_k gravitational instant…
learn2mix trains neural nets faster by adjusting class proportions dynamically.
problem Training neural nets efficiently with limited resources and imbalanced classes.
method Adaptive class proportion adjustment during training.
result Neural nets trained with learn2mix converge faster than static methods.
New methods test discrete distributions faster with local privacy constraints.
problem Testing discrete distributions under local differential privacy constraints.
method Efficient randomized algorithms and test procedures, both non-interactive and interactive.
result Faster separation rates in interactive privacy mechanisms.
We propose a novel accelerated exact k-means algorithm, which performs better than the current state-of-the-art low-dimensional algorithm in 18 of 22 experiments, running up to 3 times faster. We also propose a general improvement of existing state-of-the-art accelerated exact k-means algorithms through better estimate…
Online Conformal Inference with Retrospective Adjustment for Faster Adaptation to Distribution Shiftstat.ML
Paper proposes faster adaptation to distribution shifts in online settings.
problem Violation of exchangeability assumption in evolving data environments.
method Online conformal inference with retrospective adjustment.
result Faster adaptation to distributional shifts demonstrated through numerical studies.
A faster ADMM method for nonconvex optimization with improved complexity.
problem Nonconvex optimization problems in machine learning.
method SPIDER-ADMM, a stochastic ADMM method using a new differential estimator.
result Achieves optimal IFO complexity of for finding an -approximate stationary point.
Graphs with stronger curvature grow faster.
problem Understanding volume growth on graphs with various curvatures.
method Examined inner-outer and Ricci-Ollivier curvatures to relate them to volume growth.
result Graphs with stronger inner-outer curvature growth have faster volume growth.
Faster algorithms for solving multichain MDPs under average-reward criterion.
problem Navigating towards the best connected component in multichain MDPs.
method Developed algorithms to better solve the navigational subproblem, achieving faster convergence rates.
result Improved rates of convergence and sharper complexity measures for multichain MDPs.
Faster policy learning via continuous-time gradients.
problem Efficiently estimating policy gradients for continuous-time systems.
method Approximating continuous-time gradients directly, using adaptive discretization.
result More efficient policy gradient estimator leads to faster learning.
We propose a novel training algorithm for reinforcement learning which combines the strength of deep Q-learning with a constrained optimization approach to tighten optimality and encourage faster reward propagation. Our novel technique makes deep reinforcement learning more practical by drastically reducing the trainin…
Framework improves gradient estimation for faster training convergence.
problem Efficiently estimating noisy gradients in stochastic optimization.
method Dynamic adaptive importance sampling combining multiple distributions.
result Adaptively weighted multiple importance sampling yields superior gradient estimates.