Category
3,367 papers
Investigating an explainable DR classification framework using vision foundation models and multiple transfer learning strategies demonstrates that foundation models, particularly DINOv2, can provide strong predictive performance, while LoRA offers a parameter-efficient alternative to full fine-tuning.
This work proposes Explainable Probing of Cross-Domain Sparse Embeddings (EXPOSE), a framework that uses Sparse Autoencoders (SAEs) as an explainable bottleneck to identify and suppress domain-specific components in VFM embeddings.
This work presents a deep learning-based web system for automatic identification of Bangladeshi mango varieties and integrated the model into a Streamlit web application that enables users to upload a mango image and receive a predicted variety with class probabilities.
This work identifies the connected sample-to-sample fluctuations of the learned parameters as the microscopic origin of the singular error in linear in-context learning.
Reach audiences
Advertise in front of researchers, engineers, and readers.
This work lets reinforcement learning foragers, initially performing a random walk, optimize their dynamics from a purely individual reward for finding replenishable targets, while perceiving only their conspecifics and never the targets themselves.
Results show that energy-aware serving should jointly optimize both request energy and token energy, rather than only reducing per-token energy cost, and substantially narrows the dense-vs-MoE token-energy gap.
Video-level AUC here is thus a composite of event evidence and pre-event source cues, a shared source of discrimination that can obscure differences between representations.
Early discovery of at least one valid design satisfying a target requirement is a central objective in failure-prone closed-loop inverse design. A natural batch baseline ranks candidates by a product-form marginal valid-hit score, but selecting the highest-ranked candidates independently can produce redundant recommendations under predictive uncertainty and waste the experiment budget. We introduce ARC-SC(Anchored Risk-Constrained Scenario Coverage), a batch acquisition method that preserves strong marginal candidates as anchors and allocates the remaining batch positions by maximizing complementary coverage over predictive target scenarios under a risk-support constraint. In frozen-oracle closed-loop simulations on superconductivity and JARVIS materials-property benchmarks, ARC-SC yields a statistically supported improvement in first-hit discovery and remains competitive with directionally favorable first-hit performance on more challenging design space. These results establish ARC-SC as a POF-anchored, scenario-aware batch strategy for improving early valid-target discovery under structured experimental failure.
PMFRec learns a personalized representation generator to produce user-specific item representations from attribute features, and introduces a global multi-view encoder with item-adaptive gating and an orthogonality objective to capture complementary semantic views while reducing cross-view redundancy.
The exact DP constant is pin down for the two that carry the practical weight, counterfactual memorization and adaptive extraction, and it is shown that they do not control each other.
Efficiently and robustly analyzing shape data is critical across many scientific disciplines. While chirality is a fundamental property in numerous applications - most notably in molecular science - existing shape analysis metrics fail to distinguish between a shape and its mirror image. To address this gap, we introduce a multilinear generalization of the Gromov-Wasserstein objective. Under mild assumptions, this objective yields a distance between shapes, represented as probability distributions quotiented by a symmetry group $G$. In particular, for $G = SO(d)$, we introduce the Chiral Gromov-Wasserstein ($\mathrm{CGW}$) distance, sensitive to chirality. We establish robustness properties for the multilinear Gromov-Wasserstein distances and develop efficient algorithms to compute them, reformulating the underlying optimization problem by projecting couplings onto a low-dimensional space. We derive algorithms for both local and approximate global solutions, yielding a fully polynomial-time approximation scheme for these problems. We validate the framework through numerical experiments that demonstrate the effectiveness of $\mathrm{CGW}$ as a shape metric for chiral objects.
It is shown that the MEM dual problem admits a reformulation as an expected risk minimization problem, thereby placing MEM within the modern framework of stochastic optimization and enabling scalable stochastic gradient algorithms for large-scale inverse problems.
Machine Intelligence
A weeklong summer workshop brought higher education faculty to campus to explore how AI and machine learning materials can be adapted for their classrooms.
General Science
Climate & Sustainability
A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.
A new algorithm learns to anticipate the unprecedented scenarios that critical infrastructure and global supply chains are least prepared for.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
