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

Trend · papers per month

4692138184 · Jun 202019922001200920172026
48 results for Topological Bias

Improved 3D generative models for drug design reduce bias and enhance data efficiency.

problem Data sparsity and bias in 3D molecular design models.
method Multi-level contrastive learning protocol for bias control and data efficiency.
result Hierarchical generative models that are topologically unbiased and explainable.

Enhances MIL performance in scarce data scenarios using topological inductive biases.

problem Low performance of MIL in data-scarce scenarios.
method Incorporates topological inductive biases into MIL framework.
result Average performance improvements of 15.3% for synthetic datasets, 2.8% for benchmarks, and 5.5% for rare anemia classification.

The paper explores how the depth of neural networks affects their ability to represent data accurately.

problem Understanding the implicit bias and rank of neural networks with large depth.
method Analyzing the convergence of representation cost to a notion of rank as network depth increases, and investigating conditions for recovering the true rank of data.
result There is a range of network depths where the true rank of data is recovered, and this affects the topology of class boundaries.

Differentiable NAS frameworks grow networks wider and deeper, revealing biases in wiring evolution.

problem Understanding the evolution of neural architecture wiring in differentiable NAS methods.
method Unified view on searching algorithms, local cost minimization, empirical and theoretical analyses.
result Implicit inductive biases cause observed searching patterns in differentiable NAS methods.

This paper proposes a new method for automatically selecting the optimal kernel bandwidth in density estimation.

problem The challenge of selecting the optimal kernel bandwidth in unsupervised density estimation.
method The approach uses a topology-based loss function for automated bandwidth selection.
result Demonstrates the potential of the topology-based approach across different dimensions.

A new method for graph-structured data improves transformer performance by incorporating topology.

problem Improving transformer performance on graph-structured data.
method Parameterizing topological masks as a learnable function of a weighted adjacency matrix, approximated with graph random features.
result Efficient masking algorithms provide strong performance gains for tasks on image and point cloud data.

GCNs improve regression tasks by aggregating neighbor signals.

problem GCNs' statistical properties in regression tasks are poorly understood.
method Examined two GCN convolutions and their impact on learning error.
result GCNs have a bias-variance trade-off that depends on neighborhood size and topology.

AdaCGP learns dynamic graph topology from time series data, improving over existing methods.

problem Learning dynamic graph topology from time-varying signals, especially in real-time applications.
method AdaCGP is a sparsity-aware adaptive algorithm that recursively estimates the Graph Shift Operator (GSO) through variable splitting.
result AdaCGP outperforms state-of-the-art methods in GSO estimation, achieving improvements exceeding 83%.

Unified framework for stability and generalization of Push-Sum in decentralized learning over directed graphs.

problem Understanding stability and generalization of Push-Sum in decentralized learning over directed networks.
method Developed a unified uniform-stability framework for SGP algorithm, incorporating imbalance-aware consistency bounds.
result Established finite-iteration stability and optimization guarantees for convex and non-convex objectives.

TopoFisher learns topological summaries by maximizing Fisher information, improving parameter efficiency and inference quality.

problem Simulation-based inference misses key information in low-order statistics, especially for non-Gaussian fields.
method TopoFisher uses a differentiable persistent-homology pipeline that learns topological summaries by maximizing local Gaussian Fisher information.
result TopoFisher recovers much of the available information and outperforms fixed topological vectorizations in weak gravitational lensing.

Enhances graph neural networks with structural message-passing for better generalization.

problem Limited representation power and inability to learn basic graph topological properties.
method Proposes a framework that includes a one-hot encoding of nodes and parametrized message and update functions ensuring permutation equivariance.
result Achieves state-of-the-art results on molecular graph regression on the ZINC dataset.

MPNNs over-squash distant node information, study shows.

problem Over-squashing in MPNNs where node features ignore distant nodes.
method Theoretical analysis of MPNNs' over-squashing, focusing on width, depth, and graph topology.
result Width mitigates over-squashing but makes network more sensitive, depth doesn't help, graph topology is key.

We study the phenomenon of bias amplification in classifiers, wherein a machine learning model learns to predict classes with a greater disparity than the underlying ground truth. We demonstrate that bias amplification can arise via an inductive bias in gradient descent methods that results in the overestimation of the…

2018-12-21abs ↗pdf ↗

It has been noticed that some external CVIs exhibit a preferential bias towards a larger or smaller number of clusters which is monotonic (directly or inversely) in the number of clusters in candidate partitions. This type of bias is caused by the functional form of the CVI model. For example, the popular Rand index (R…

2016-06-17abs ↗pdf ↗

Proposes a transformer model with geostatistical inductive bias for spatio-temporal forecasting.

problem Combining probabilistic rigor of geostatistics with flexible deep learning representations.
method Spatially-informed transformer with learnable covariance kernel.
result Successfully recovers spatial decay parameters end-to-end via backpropagation.

Depth uncertainty networks don't improve with bias correction, contrary to expectations.

problem Improving performance in active learning with overparameterised models like NNs.
method Depth uncertainty networks, compared to underparameterised models, show no improvement in performance with bias correction.
result Depth uncertainty networks do not improve with bias correction, unlike underparameterised models.

We quantify causal bias in continuous treatment settings.

problem Identifying and quantifying causal bias in continuous treatment scenarios.
method Developed a novel characterization of causal bias in structural causal models, proving conditions for zero bias and efficient estimation.
result Causal bias can be estimated efficiently under certain structural equation restrictions, allowing for causal regularization of predictive models.

The paper introduces Relative Bias to quantify LLM bias systematically.

problem Quantifying bias in LLMs is challenging due to ambiguity and rapid model emergence.
method Relative Bias framework using Embedding Transformation and LLM-as-a-Judge methodologies.
result The two scoring methods show strong alignment, providing a systematic approach.

SSMs have a built-in bias towards low-frequency components, which can be adjusted.

problem Frequency bias in SSMs affects their performance on long-range sequences.
method Proposed two mechanisms to tune frequency bias: scaling initialization or applying a Sobolev-norm-based filter.
result Tuning frequency bias improves SSMs' performance on long-range sequence learning tasks.

A bias classifier is introduced to resist adversarial attacks.

problem Resisting adversarial attacks on deep neural networks (DNNs).
method Introducing the bias part of a DNN with Relu as the activation function as a classifier, and adding a random first-degree part to make it information-theoretically safe.
result The bias classifier is more robust than DNNs of similar size against adversarial attacks.

UBM transfers bias mitigation from upstream to downstream tasks efficiently.

problem Bias in fine-tuned language models across various tasks.
method Apply bias mitigation to an upstream model, then fine-tune a downstream model on this mitigated model.
result UBM effects transfer to new downstream tasks, creating less biased models.

Ensembles improve classifier performance by reducing bias, not variance.

problem Improving classifier performance through ensemble methods.
method Extended bias-variance decomposition for classification tasks, introducing dual reparameterization.
result Ensembling reduces bias in classifiers, contrary to the traditional view.

Reduces gender bias in patient notes while maintaining medical classification accuracy.

problem Bias in natural language processing of patient notes.
method Identifying and removing gendered language using BERT-based classifiers, then augmenting data to maintain performance.
result Minimal degradation in health condition classification tasks with data augmentation.

Study analyzes bias interactions in multimodal models using simulation-based methods.

problem Analyzing dynamic bias interactions in multimodal models to ensure fairness and equity.
method Simulation-based heuristic approach to compute bias scores for text-only, image-only, and multimodal embeddings.
result Multimodal bias interactions can be amplification, mitigation, or neutral, with text bias often dominant.

Study uncovers bias in image classification models using attribution maps.

problem Data bias in image classification models.
method Created an artificial dataset with known bias, trained CNNs, and used attribution maps to inspect decisions.
result Different attribution map techniques highlight bias better than others, and metrics support bias identification.

Study on bias and extrapolation in LSA with Markovian data, showing bias reduction with Richardson-Romberg extrapolation.

problem Bias in LSA with constant stepsizes and Markovian data.
method Viewing LSA as a Markov chain, proving convergence and bias expansion, and applying Richardson-Romberg extrapolation.
result Bias is proportional to the stepsize up to higher order terms, and Richardson-Romberg extrapolation reduces the bias.

The paper detects and identifies bias in data using a counterfactual approach.

problem Detecting and identifying bias in data, especially in medical image classification.
method A global explanation framework using the counterfactual approach to identify bias causing artifacts.
result Black frames significantly influence Convolutional Neural Network's prediction, changing benign to malignant.