Related Experiment Video
Updated: Apr 9, 2026

12:05
A Simple, Robust, and High Throughput Single Molecule Flow Stretching Assay Implementation for Studying Transport of Molecules Along DNA
Published on: October 1, 2017
8.7K
S4ST: A Strong, Self-Transferable, faSt, and Simple Scale Transformation for Data-Free Transferable Targeted Attack
Summary
Transferable Targeted Attacks (TTAs) are improved by simple scaling transformations, offering a data-free method that enhances model security without needing victim model data.
Area of Science:
- Computer Science
- Artificial Intelligence
- Machine Learning Security
Background:
- Transferable Targeted Attacks (TTAs) suffer from overfitting to surrogate models.
- Existing data-free solutions often require black-box feedback, compromising fairness.
- Current methods struggle with strict black-box transfer settings.
Purpose of the Study:
- To propose blind estimation measures for analyzing transformation effectiveness under black-box constraints.
- To challenge conventional assumptions in TTA research.
- To develop a data-free TTA method with state-of-the-art effectiveness and efficiency.
Main Methods:
- Introduced self-alignment and self-transferability measures for transformation analysis.
- Investigated the impact of basic image transformations (scaling, geometric, color) on TTA.
- Designed S⁴ST (Strong, Self-transferable, faSt, Simple Scale Transformation) integrating scaling, low-redundancy, and block-wise operations.
Main Results:
- Simple scaling transformations uniquely enhance targeted transferability.
- Geometric and color transformations show high internal redundancy.
- S⁴ST achieves state-of-the-art effectiveness-efficiency balance without data dependency across diverse settings.
Conclusions:
- Scaling's effectiveness is linked to the multi-scale nature of visual data and training augmentations.
- The proposed blind estimation measures and S⁴ST framework offer a robust, data-free solution for TTAs.
- The method demonstrates strong generalization capabilities on medical imaging and face verification tasks.
Related Concept Videos
Fast Fourier Transform
1.2K
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
1.2K
Types of Genetic Transfer Between Organisms
32.0K
Genetic transfer occurs when genetic information is passed from one organism to another. It occurs via two mechanisms: vertical gene transfer and horizontal gene transfer. Vertical gene transfer occurs when genetic information is transferred from one generation to the next, which happens much more frequently than horizontal gene transfer. Both sexual and asexual reproduction are forms of vertical gene transfer, where one or more organisms pass some or all of their genome onto their progeny.
32.0K
Types of Genetic Transfer Between Organisms
6.8K
6.8K
Transformation
1.3K
Microbial communities are dynamic environments where cell lysis releases free DNA into the surroundings. Other cells can take up this extracellular DNA through a process known as transformation.When a cell incorporates this foreign DNA into its genome, resulting in genetic modification, the process is known as transformation. Cells capable of this process are termed competent. Competence can be natural, as observed in certain bacteria and archaea, or artificially induced in the...
1.3K
Introduction to Scalers
2.8K
2.8K
Fast Decoupled and DC Powerflow
851
The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
851