Research
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,742 papers · 148 categories

Trend · papers per month

10192938 · Jun 202019922001200920172026
48 results for cell patch clamp

Machine learning predicts NaV1.7 inhibitors, leading to effective drug K1.

problem Predicting and optimizing NaV1.7 inhibitors for therapeutic use.
method Machine learning, specifically RF-CDK model, for predicting and screening.
result RF-CDK model identified effective compound K1, verified by cell patch clamp.

The paper sets lower bounds for Laplacian eigenvalues and clamped plate problem eigenvalues.

problem Eigenvalues of the Laplace operator and clamped plate problem.
method Sharp lower bounds for Laplacian eigenvalues and clamped plate problem eigenvalues.
result Sharp lower bounds for Laplacian eigenvalues and clamped plate problem eigenvalues.

Affirm Lord Rayleigh's conjecture on curved spaces for clamped plates.

problem Lord Rayleigh's conjecture for vibrating clamped plates on curved spaces.
method Nodal-decomposition argument, Lévy-Gromov isoperimetric inequality, Gaussian hypergeometric functions, sharp spectral gap estimates.
result Positive curvature enhances genuine differences between low- and high-dimensional settings.

We examine the effect of clamping variables for approximate inference in undirected graphical models with pairwise relationships and discrete variables. For any number of variable labels, we demonstrate that clamping and summing approximate sub-partition functions can lead only to a decrease in the partition function e…

2015-10-01abs ↗pdf ↗

New isoperimetric inequality for clamped plates in RCD(0,N) spaces, sharp and stable.

problem Fine properties of the principal frequency of clamped plates in RCD(0,N) spaces.
method Analyzing the RCD(0,N) spaces and applying isoperimetric inequalities.
result Sharp isoperimetric inequality for the principal frequency of clamped plates in RCD(0,N) spaces.

Study curves evolving by gradient flow of elastic energy, proving existence, smoothing, and convergence.

problem Evolution of curves with fixed length and clamped boundary conditions.
method Negative L2L^2-gradient flow of elastic energy, existence, parabolic smoothing, constrained Lojasiewicz-Simon gradient inequality.
result Convergence to a critical point as time tends to infinity.

This paper studies eigenvalues of the clamped plate problem on a bounded domain in an nn-dimensional Euclidean space. We give an estimate for the gap between Γk+1Γ1\sqrt {Γ_{k+1}-Γ_{1}} and ΓkΓ1\sqrt {Γ_{k}-Γ_{1}}, for any positive integer kk. According to the asymptotic formula of Agmon and Pleijel, we know, the gap betwe…

2016-10-19abs ↗pdf ↗

CLAMP uses neural manifold packing to improve self-supervised learning.

problem Improving self-supervised learning for vision tasks.
method CLAMP recasts representation learning as a manifold packing problem, introducing a loss function inspired by particle systems.
result CLAMP achieves competitive performance with state-of-the-art models and separates neural manifolds effectively.

The paper studies eigenvalue inequalities for a clamped plate problem involving a generalized elliptic differential operator.

problem Eigenvalue inequalities for a clamped plate problem involving a generalized elliptic differential operator.
method Extending the LII\mathfrak{L}_{II} operator to Lν\mathfrak{L}_ν, establishing a general formula for eigenvalues, and applying it to estimate eigenvalues on Riemannian manifolds.
result Established eigenvalue inequalities for the Lν2\mathfrak{L}_ν^{2} operator on translating solitons and other geometric settings.

We study Lord Rayleigh's problem for clamped plates on an arbitrary nn-dimensional (n2)(n\geq 2) Cartan-Hadamard manifold (M,g)(M,g) with sectional curvature Kκ2\textbf{K}\leq -κ^2 for some κ0.κ\geq 0. We first prove a McKean-type spectral gap estimate, i.e. the fundamental tone of any domain in (M,g)(M,g) is universally bounde…

2019-09-05abs ↗pdf ↗

Euler's elastica with monotone curvature is uniquely minimal.

problem Global minimality of planar elastica with monotone curvature.
method Proof of global minimality using clamped boundary conditions and length penalization.
result Every planar elastica with non-constant monotone curvature is uniquely minimal.

Paper studies eigenvalues of a specific operator on Riemannian manifolds.

problem Eigenvalues of a specific operator on Riemannian manifolds.
method Established a general formula for eigenvalues and derived estimates.
result Obtained universal inequalities for the eigenvalues on translating solitons.

Proposes a new approach to time series representation learning by embedding patches independently.

problem Capturing dependencies between time series patches is not optimal for representation learning.
method 1) Patch reconstruction task, 2) Patch-wise MLP, 3) Complementary contrastive learning.
result Improves time series forecasting and classification performance compared to state-of-the-art models.

Paper proves rigidity estimates for hyperbolic shells and applies them to \(Γ\)-limit theory.

problem Rigidity of hyperbolic shells and their \(Γ\)-limit behavior.
method Nonlinear rigidity estimates for \(H^1\) deformations and hyperbolic shells with clamped lateral boundary.
result Derives the optimal exponent \(h^{-4/3}\) for hyperbolic shells.

New method makes neural networks more resilient to location-optimized adversarial patches.

problem Neural networks' vulnerability to adversarial patches that are visible but still effective.
method Developed a practical approach to optimize patch locations and applied adversarial training.
result Significantly improved robustness against adversarial patches on CIFAR10 and GTSRB.

Neural networks are commonly trained to make predictions through learning algorithms. Contrastive Hebbian learning, which is a powerful rule inspired by gradient backpropagation, is based on Hebb's rule and the contrastive divergence algorithm. It operates in two phases, the forward (or free) phase, where the data are …

2018-06-19abs ↗pdf ↗

Reinforcement Patching optimizes dynamic sequence patching for efficient time series forecasting.

problem Efficiently learning data-adaptive representations for long-horizon sequence data, especially continuous sequences.
method Reinforcement Patching (ReinPatch) uses reinforcement learning to optimize dynamic patching policies and sequence backbones.
result ReinPatch achieves compelling performance in time-series forecasting compared to state-of-the-art methods.

Analytic patch trees reveal new geometric structures and dimension fields.

problem Understanding the geometric and analytical properties of surface patch trees.
method Developed analytic surface patch trees and introduced interface curves to transmit state.
result Surface patch trees have natural foliations with one-dimensional curve trees and dimension fields.

MAT combines meta-learning and adversarial training to defend against universal patches.

problem Defending against universal patches that fool models in various contexts.
method Meta adversarial training (MAT) integrates meta-learning with adversarial training.
result MAT increases robustness against universal patch attacks on image classification and traffic-light detection.

Patch priors have become an important component of image restoration. A powerful approach in this category of restoration algorithms is the popular Expected Patch Log-Likelihood (EPLL) algorithm. EPLL uses a Gaussian mixture model (GMM) prior learned on clean image patches as a way to regularize degraded patches. In th…

2018-02-05abs ↗pdf ↗

BagCert efficiently certifies robustness against adversarial patches on image classifiers.

problem Adversarial patches pose a threat to autonomous systems' perception component.
method BagCert combines model architecture and certification procedure for efficient inference.
result BagCert certifies 10,000 examples in 43 seconds on a single GPU, achieving 86% clean and 60% certified accuracy against 5x5 patches.

In this paper we address the problem of understanding the success of algorithms that organize patches according to graph-based metrics. Algorithms that analyze patches extracted from images or time series have led to state-of-the art techniques for classification, denoising, and the study of nonlinear dynamics. The mai…

2011-07-02abs ↗pdf ↗

The main ob jective of this research is to find the different types of elliptic triangulations for planar discs and spheres. We begin in Chapter 1 with the mandatory introduction. In the second chapter we define and study the notion of a patch, that is, a triangulation of a planar disc. By introducing a suitable notion…

2006-08-03abs ↗pdf ↗

Ano-SuPs detects anomalies in images of manufactured products by identifying suspected patches.

problem Challenges in detecting anomalies in image-based manufacturing systems, including complexity of background and various anomaly patterns.
method Two-stage strategy anomaly detection method: first, remove suspected patches; second, refine anomaly identification using normal patches.
result Demonstrated effectiveness through simulation and case studies, identifying key parameters and steps impacting model performance and efficiency.

Universal adversarial patches prevent face detection in various frameworks.

problem Preventing face detection in state-of-the-art face detection systems.
method Investigated the phenomenon of patches that suppress face detection and proposed optimization-based approaches for automatic design.
result Universal adversarial patches can prevent face detection without introducing false positives.

In this paper, we demonstrate a physical adversarial patch attack against object detectors, notably the YOLOv3 detector. Unlike previous work on physical object detection attacks, which required the patch to overlap with the objects being misclassified or avoiding detection, we show that a properly designed patch can s…

2019-06-20abs ↗pdf ↗

Sharp spectral gap estimates for higher-order operators on hyperbolic spaces.

problem Estimating spectral gaps for higher-order operators on Cartan-Hadamard manifolds.
method Symmetrization-free proofs based on general functional inequalities.
result Solves a sharp asymptotic problem from Cheng and Yang and answers a question from Kristály.

There have been different strategies to improve the performance of a machine learning model, e.g., increasing the depth, width, and/or nonlinearity of the model, and using ensemble learning to aggregate multiple base/weak learners in parallel or in series. This paper proposes a novel strategy called patch learning (PL)…

2019-06-01abs ↗pdf ↗

PatchGuard defends against localized adversarial patches with provable robustness.

problem Localized adversarial patches induce misclassification in machine learning models.
method PatchGuard uses CNNs with small receptive fields and robust masking to detect and mask corrupted features.
result PatchGuard achieves state-of-the-art provable robust accuracy and clean accuracy.

Recent work (Pennington et al, 2017) suggests that controlling the entire distribution of Jacobian singular values is an important design consideration in deep learning. Motivated by this, we study the distribution of singular values of the Jacobian of the generator in Generative Adversarial Networks (GANs). We find th…

2018-02-23abs ↗pdf ↗