Skip to main content
Search

# Principal Component Analysis

8 related articles

Subscribe to updates
  1. bioRxiv

    Inside a protein language model, binary patterns form a jellyfish: hydrophobic content sets the main axis while heptad phase curls into a ring

    In ESM2 residue embeddings, polar/nonpolar binary patterns organize into a readable geometry. Generating 50 sequences for each of all 128 heptad binary patterns, 6400 in total, and running position-preserving PCA yields a jellyfish-shaped manifold: hydrophobic content spreads along PC1, while PC2 and PC3 encode heptad phase as near sine and cosine. A charge alphabet stays ordered, but scrambled amino-acid groupings or the non-protein model ByT5 lose the cyclic organization.

  2. arXiv

    DINGO-TGR cuts a six-parameter gravity test to 38 minutes, and 1,000 noise injections find GW150914's offset unremarkable

    DINGO-TGR infers binary parameters and six post-Newtonian phase-deformation parameters jointly with neural posterior estimation, then reweights the network's approximate posterior by importance sampling. For GW150914 the inference takes about 38 minutes against roughly 177 hours for bilby-tgr with dynesty, and about 4.4 hours against 238 hours for the higher signal-to-noise GW250114. GW150914 shows a mild offset from general relativity in the leading principal-component mode, but 115 of 1,000 general-relativity injections resembling GW150914 reach or exceed that offset, an empirical upper-tail p-value of about 0.115 that does not reject the general-relativity null at the 5% level.

  3. arXiv

    Quasar periodicity tests drop the DRW null: Nullasar learns noise from light curves and reaches AUC 0.9648 on AR(2) data

    Quasar variability is usually tested for periodic signals against a damped random walk (DRW) null, and a mis-specified noise model biases the significance estimates. Nullasar uses flow matching to learn the statistical structure of stochastic variability from an ensemble of synthetic light curves without assuming a noise model, then generates null realizations conditioned on a single observed curve. On synthetic AR(2) light curves its periodicity-detection AUC is 0.9648, averaged over three independently trained models, above 0.9180 for fitting AR(2) per curve; in the AR(1) case it matches fitting the correct DRW model.

  4. arXiv

    Subsurface flow data assimilation gets adaptive-tempered sequential Monte Carlo: posteriors match reference MCMC on four synthetic truths, with 2.5–7.0× single-GPU speedups

    Geological uncertainty in subsurface flow systems is often hierarchical: a set of geological metaparameters controls overall statistics while cell-by-cell property fields vary, and both must be estimated from observations. An adaptive-tempered sequential Monte Carlo method estimates metaparameters and Gaussian latent variables jointly within one likelihood framework, with surrogate models supplying all forward evaluations. Across four synthetic true models, its posterior metaparameter distributions and flow predictions agree closely with reference MCMC results, while single-GPU data assimilation is 2.5–7.0 times faster and needs fewer function evaluations.

  5. Nuclear-mass prediction steps out of the black box: an interpretable AI rediscovers forgotten Jaffe factorization and pushes WS4 error below 0.12 MeV

    Nuclear physics has long relied on phenomenological models to predict nuclear binding energies, while high-precision AI models are hard to trust when extrapolating. An interpretable neural network taking only proton and neutron numbers as input spontaneously forms a double-helix geometry in its internal representations, reproduces macroscopic terms such as the liquid-drop model in a principal-component decomposition, and rediscovers the local Jaffe factorization proposed in 1969 and since overlooked. Applied as a local correction to the WS4 model, this factorization brings the root-mean-square binding-energy error below 0.12 MeV without relying on a black box.

  6. AI readiness tracks clinical tasks, not specialties: 330-task scoring finds task category explains ten times more variance

    Whether a medical specialty is ready for AI depends more on which clinical tasks it contains than on its name. A framework scored 330 clinical tasks, 15 for each of 22 specialties drawn from the American Board of Medical Specialties list, on six dimensions: codifiability, data-structure dependence, transferability of decision authority, physical dependence, clinical governability and specialty centrality, each on a three-point scale, then aggregated them into a Medical Specialty AI Readiness (MSAIR) score. Task category explained 71.6% of adjusted R² versus 6.4% for specialty; documentation scored highest on average (2.874) and emergency decision making lowest (1.639), while specialty means spanned only 2.010 to 2.543.

  7. Impedance fitting stops picking a circuit first: PCA nearest neighbours supply both candidates and starting values, matching manual fits within 1%

    Equivalent-circuit fitting of electrochemical impedance spectra has depended on a human choosing a circuit topology and starting values, even though different topologies can produce nearly identical spectra. A University of Zagreb team expanded a few manually fitted spectra into a synthetic reference library, projected it into principal-component space, and used nearest-neighbour retrieval to shortlist topologies and supply physically plausible starting values at once, then refined each candidate by complex nonlinear least squares and chose by fit quality. Against independent manual fits, most parameters agreed within 1%, reduced chi-squared was lower in every case, and one spectrum took about 5 to 6 seconds.

  8. A PCA-plus-local-differential-privacy framework for agricultural data sharing trades about 5.33% average accuracy loss for privacy on real datasets

    The work proposes a privacy-preserving data-sharing and collaboration framework for digital agriculture that combines Principal Component Analysis (PCA) dimensionality reduction with Laplacian-noise-based local differential privacy (ε-LDP), aggregates farmer data in a sandbox environment, and uses K-Means clustering and nearest-neighbor algorithms to recommend potential collaborators, enabling researchers to train personalized models via federated learning or directly on aggregated privacy-protected data; validated on the Wisconsin Farmer's Market and Crop Recommendation real-world datasets, model accuracy shows an average loss of about 5.33% compared with centralized raw-data training, with robustness against attacks such as membership inference assessed via power analysis.

You’re all caught up