This paper approximates p-resistance for multi-class graph clustering.
problem Efficiently clustering graphs with p-Laplacian bias. method Developed an approximation to p-resistance for multi-class clustering. result Approximated p-resistance provides a computationally feasible alternative to p-Laplacian eigenvectors. New curvature defined via graph resistances leads to Ricci flow.
problem Defining curvature on graph edges for analysis.
method Introducing Ricci--Foster curvature based on effective resistances and studying Ricci flow.
result Existence of solutions to Ricci flow on short time intervals, preservation of nonnegative curvature.
New method calculates discrete curvature using effective resistances.
problem Calculating discrete curvature on graphs.
method Effective resistances to calculate curvature on graph nodes and links.
result Relation to established discrete curvatures and convergence to continuous curvature.
Algorithm learns item qualities from noisy comparisons, scaling with graph resistance.
problem Learning item qualities from noisy comparisons.
method Minimax optimal algorithm using comparison graph resistance.
result Algorithm's performance scales with the square root of graph resistance.
Graph curvature measured by inverse resistance distance.
problem Defining and analyzing curvature in graphs.
method Defining curvature via inverse resistance distance and proving properties.
result Graphs with positive curvature have controlled diameter and spectral properties.
New invariant for special alternating links based on graph Laplacian.
problem Developing an invariant for special alternating links.
method Using the Laplacian matrix of the Tait graph, invariant is defined.
result A specific quadratic trace expression is invariant under flype moves.
Proves bounds on spanning two-forests and random cut sizes.
problem Counting spanning two-forests and estimating random cut sizes.
method Uses pairwise effective resistances and potential theory.
result Establishes bounds on the number of spanning two-forests and average cut size.
Efficiently infers graph edges from genetic similarity data in landscape genetics.
problem Inferring unknown graph edges from genetic similarity data in a heterogeneous landscape.
method Developed an efficient first-order optimization method to solve the inverse landscape genetics problem.
result Our method provides fast and reliable convergence, significantly outperforming existing heuristics.
Graph Cascades rewire graphs to improve structure-aware learning.
problem Improving graph neural networks and transformers for structure-aware learning.
method Graph Cascades uses contagion-based diffusion processes to construct an auxiliary graph with reinforced edges.
result Graph Cascades improves node-classification benchmarks across various graph types.
We describe an algorithm that recognizes some (perhaps all) intrinsically knotted (IK) graphs, and can help find knotless embeddings for graphs that are not IK. The algorithm, implemented as a Mathematica program, has already been used by Goldberg, Mattman, and Naimi [6] to greatly expand the list of known minor minima…
GraphAT improves graph neural networks by dynamically considering connected examples in adversarial training.
problem Graph neural networks are vulnerable to adversarial perturbations due to connections between examples.
method GraphAT dynamically regularizes based on graph structure to resist adversarial perturbations.
result GraphAT outperforms normal training on GCN by 4.51% in node classification accuracy.
There have lately been several suggestions for parametrized distances on a graph that generalize the shortest path distance and the commute time or resistance distance. The need for developing such distances has risen from the observation that the above-mentioned common distances in many situations fail to take into ac…
Enhances GCNs to resist graph attacks.
problem Vulnerability of GCNs to topological attacks.
method Introduces a new robust convolution operator and training paradigm.
result Improves adversarial robustness and performance.
Stable topological summary captures evolving dependency structure in dynamic Bayesian networks.
problem Missing larger-scale patterns in evolving dependency structures in dynamic Bayesian networks.
method Topological approach using Dynamic Bayesian Graphs and persistent homology.
result Stable topological summary (barcodes) captures evolving dependency structure in DBNs.
Generative model designs drug combinations for improved efficacy and reduced side effects.
problem Designing effective drug combinations to overcome resistance and reduce side effects.
method Developed a deep generative model using HVGAE and a novel reward system.
result Network-principled drug combinations show reduced toxicity and potential for new strategies.
FAL improves formation resistivity prediction from cased boreholes with noise resistance.
problem Noise and high-frequency disaster in predicting formation resistivity from cased boreholes.
method Frequency-aware framework and temporal anti-noise block for LSTM.
result FAL achieves a 24.3% improvement in R2 over LSTM, reaching R2=0.91.
Optimal trading strategy under market resistance and concave price impact model.
problem Optimal trading in a market with endogenous resistance and concave price impact.
method Modeling market resistance, deriving a stochastic Fredholm equation, proving existence and uniqueness, proposing an iterative scheme.
result Existence and uniqueness of optimal control under certain conditions, exponential convergence of iterative scheme.
Extends Newton's minimal resistance problem to Riemannian surfaces.
problem Minimal resistance on Riemannian surfaces.
method Derive resistance functional, analyze constrained minimization.
result Smooth extremals are loxodromes, global minimizers characterized.
FastGAT reduces GNN computation time by 10x using graph sparsification.
problem High computational burden in attention-based GNNs.
method Spectral sparsification to generate optimal graph pruning.
result Per-epoch time is almost linear in graph nodes, reducing computational time by up to 10x.
Paper proves conditions for estimating precision matrices with Laplacian constraints.
problem Estimating high-dimensional precision matrices with Laplacian constraints.
method Minimizing Stein's loss with conditions on graph connectivity and Laplacian constraints.
result High-dimensional consistency achieved with Laplacian constraints, independent of graph structure.
Researchers propose improved multivariate prediction models for HIV drug resistance.
problem Predicting drug resistances of HIV from mutation information.
method Revised stacking algorithms to borrow information among multiple prediction tasks.
result Proposed methods outperform other multivariate prediction methods.
Extends Newton's minimal resistance problem to Lorentz-Minkowski space.
problem Minimal resistance in Lorentz-Minkowski space.
method Derived functional energy, determined Euler-Lagrange equation, analyzed maximum principle, found separable and radial solutions.
result Obtained solutions with conical singularities at the origin and analyzed the Single Shock Condition.
Study tackles causal effects of close contact on MRSA infections from entangled treatment data.
problem Estimating causal effects of close contact on MRSA infections from observational data with entangled treatments.
method NEAT method that models treatment assignment mechanism and mitigates confounding biases.
result NEAT method effectively estimates causal effects from entangled treatment data.
Proposes a new method to improve deep model security against adversarial deformations.
problem Deep neural networks' resistance to adversarial attacks, especially location perturbations.
method Regularizes flow gradients to provide a tighter bound and improve model resistance.
result Models trained with flow gradient regularization show better resistance to adversarial deformations compared to input gradient regularization and adversarial training.
The article deals with intrinsic metrics, Dirac operators and spectral triples induced by regular Dirichlet and resistance forms. We show, in particular, that if a local resistance form is given and the space is compact in resistance metric, then the intrinsic metric yields a geodesic space. Given a regular Dirichlet f…
Study predicts antimicrobial resistance in ICU patients quickly.
problem Delayed AMR testing in ICU leads to suboptimal treatment.
method Developed predictive models using clinical and microbiological data.
result Machine learning models predict AMR with higher accuracy than naive model.
This research improves CNNs' resistance to adversarial examples.
problem Vulnerability of CNNs to adversarial examples.
method Intelligent hyperparameter selection for model resistance.
result Selection of model hyperparameters impacts resistance to adversarial examples.
Graph neural networks improve with affinity measures from random walks.
problem Limited expressivity of GNNs due to small receptive field.
method Introduced affinity measures from random walks into GNNs.
result Affinity measures enhance GNN performance on various tasks.
Paper explores robust regression methods and their bias-variance trade-off.
problem Understanding the trade-off between robust estimation and optimization methods.
method Examines traditional outlier-resistant robust estimation and robust optimization.
result Both methods follow converse strategies due to a bias-variance trade-off.
Graph clustering remains challenging for GNNs, but a new method improves performance.
problem Graph clustering is difficult for GNNs, especially in noisy data.
method Developed Deep Modularity Networks (DMoN) inspired by modularity measure.
result DMoN produces high-quality clusters with over 40% improvement over other methods.
Post-quantum cryptography needed for blockchain security.
problem Quantum computers threaten traditional blockchain cryptography.
method Review of theoretical cryptography and quantum information theory.
result Post-quantum cryptography is essential for blockchain security.
Deep learning identifies 30 common bacterial pathogens from Raman spectra.
problem Rapid and accurate identification of pathogenic bacteria.
method State-of-the-art deep learning applied to large Raman spectroscopy dataset.
result 99.0% accuracy in identifying 30 common bacterial pathogens.
Antimicrobial resistance is an important public health concern that has implications in the practice of medicine worldwide. Accurately predicting resistance phenotypes from genome sequences shows great promise in promoting better use of antimicrobial agents, by determining which antibiotics are likely to be effective i…
The paper studies minimal resistance dynamics in radial fields, finding unique solutions for incompressible flows.
problem Nonlinear dynamics of minimal resistance in radial fields.
method Analysis of two non-equilibrium scenarios: scale-invariant free expansion and incompressible source flow.
result Incompressible flow acts as a structural regularizer, admitting unique, smooth, and strictly concave solutions.
New method uses mosaics to study wild knots.
problem Classifying wild knots with infinite knotting behavior.
method Extending knot mosaic theory to represent wild knots with isolated wild points.
result Developed a framework for mosaic tangles and mosaic rigid vertex spatial graphs.
New method designs antimicrobial peptides with high potency and low toxicity.
problem Designing potent antimicrobial drugs with low toxicity.
method CLaSS method using deep generative autoencoder and atomistic simulations.
result Design and synthesis of two novel AMPs with high potency and low toxicity.
Study optimal times to buy and sell stocks using support/resistance lines.
problem Optimal times to buy and sell stocks based on support and resistance lines.
method Mathematical model with probabilistic methods to solve optimal stopping problems.
result Best times to buy and sell stocks are determined by solving free boundary problems.
The report studies ranking from pairwise comparisons in graphs, achieving optimal error bounds and proposing efficient algorithms.
problem Ranking items from pairwise comparisons in general graphs and graphs with locality.
method Maximum likelihood estimation (MLE) and preconditioned gradient descent for general graphs; divide-and-conquer algorithms for graphs with locality.
result MLE achieves optimal error bounds in general graphs and identifies conditions for locality.
Spectral graph sparsification preserves geometry of GNN embeddings.
problem Maintaining geometric properties of graph neural network embeddings during sparsification.
method Proving spectral sparsification preserves squared pairwise distances, class means, and covariance structure in embedding space.
result Spectral sparsification preserves the geometry of learned embeddings in GNNs.
Paper proves minimal resistance for a body in a fluid with decreasing density.
problem Minimal resistance for a body moving through a fluid with non-constant density.
method Local existence and regularity of radial solutions using a fixed-point theorem.
result Maximal domain of the solution is finite, terminating at a critical slope.
New piracy-resistant watermarks for deep neural networks prevent false claims.
problem Protecting deep learning models from false claims by embedding pirate watermarks.
method Null embedding, a new approach to build watermarks that resist removal and addition.
result Null embedding achieves piracy resistance and other watermark properties over various tasks and models.
This paper optimizes predicting support and resistance levels in financial markets.
problem Optimizing prediction of resistance and support levels in financial markets.
method Assuming a constant elasticity of variance process, the paper derives optimal trading boundaries using the aspiration level hypothesis.
result Optimal trading boundaries serve as predictors of resistance and support levels, located relative to the median interval of the hidden aspiration level.
Paper explains AdaBoost's overfitting resistance from feature learning perspective.
problem Understanding AdaBoost's resistance to overfitting.
method Adopt AdaBoost for base classifiers, then use them as features in SVM.
result Proposes AdaBoost+SVM algorithm to explain overfitting resistance.
The paper discovers and evaluates support and resistance levels in financial time series.
problem Understanding and predicting support and resistance levels in financial markets.
method Developed a heuristic discovery algorithm to identify SR levels in intraday price series.
result Discovered SR levels statistically significantly reverse price trends and have a decay aspect over time.
ISP improves GNN expressivity by stratifying nodes based on graph invariants.
problem Graph Neural Networks struggle with expressivity and structural heterogeneity.
method Invariant-Stratified Propagation (ISP) using ISP-WL and ISPGNN.
result ISP achieves enhanced expressivity beyond 1-WL, with theoretical guarantees and practical improvements.
New algorithm eliminates symmetry requirement for training neural networks on resistive device arrays.
problem Training accuracy on resistive device arrays depends on device switching symmetry.
method Developed 'Tiki-Taka' algorithm to minimize unintentional cost term due to device asymmetry.
result Achieves same accuracy with non-symmetric devices as with symmetric devices.
Prototype controls stochastic drug resistance in cells.
problem Emergence of drug-resistant cells from random mutations.
method Deep reinforcement learning for adaptive drug dosing.
result 100% success rate in suppressing cell proliferation.
New matrix completion method for arbitrary sampling patterns using network flows.
problem Matrix completion under arbitrary sampling patterns.
method Network flow approach to matrix completion.
result Minimax optimal estimation for individual entries.