Upload your resume. PhdFit's six research agents compare your background with faculty profiles, recent publications, lab focus, and outreach opportunities, then rank professors with evidence you can review.
Resume-aware matchingEvidence from recent researchOutreach drafts included
Advisor Match Brief Resume uploaded
Resume signals5 found
NLPHCIFairnessGraph MLPyTorch
Six-agent analysisRunning
Axel · Candidate AnalystResume parsed
Nova · Professor ResearcherRecent papers
Echo · Match ExplainerEvidence linked
Atlas · Strategy AdvisorFit ranked
Lyra · Outreach WriterDraft queued
Juno · Meeting Prep CompilerNext step ready
SC
Dr. Sarah Chen
Stanford · NLP & interpretability
91
fit
Fairness + NLP projects overlap with her recent work.
Strong methods fit: model evaluation and interpretability.
Clear outreach angle for current trustworthy AI research.
Outreach angle
Ask how her lab is extending interpretability methods into fairness audits for real-world AI systems.
Davi Geiger
· Associate Professor of Computer Science and Neural ScienceVerified
Marcelo Cicconet has over 15 years of experience in artificial intelligence, encompassing a broad range of areas including machine learning, computer vision, computer music, signal processing, and natural language processing, along with various applications. He completed his PhD at IMPA and has worked as a researcher and developer at prestigious institutions such as Georgia Tech, NYU, and Harvard Medical School. Currently, he serves as the Director of AI at deliberate.ai, where he leads efforts on multimodal AI-based assessment of psychiatric and neurological health.
This paper presents a quantum method to tackle optimization challenges. Departing from the typical applications of quantum theory in particle physics, we demonstrate our approach using the elastica problem as a concrete example. The elastica, a classic variational problem extensively studied by mathematicians, serves as an ideal test case. Within quantum theory, our central innovation lies in the way we handle boundary conditions by combining forward and backward propagating wave solutions, a concept inspired by the superposition of forward and backward time-traveling particle waves in quantum mechanics. This approach not only provides a novel solution method for the elastica problem but also opens new pathways for applying quantum mathematical techniques to classical optimization challenges in other domains.
This work investigates the geometric foundations of modern stereo vision systems, with a focus on how 3D structure and human-inspired perception contribute to accurate depth reconstruction. We revisit the Cyclopean Eye model and propose novel geometric constraints that account for occlusions and depth discontinuities. Our analysis includes the evaluation of stereo feature matching quality derived from deep learning models, as well as the role of attention mechanisms in recovering meaningful 3D surfaces. Through both theoretical insights and empirical studies on real datasets, we demonstrate that combining strong geometric priors with learned features provides internal abstractions for understanding stereo vision systems.
Recent advances in computer vision have predominantly relied on data-driven approaches that leverage deep learning and large-scale datasets. Deep neural networks have achieved remarkable success in tasks such as stereo matching and monocular depth reconstruction. However, these methods lack explicit models of 3D geometry that can be directly analyzed, transferred across modalities, or systematically modified for controlled experimentation. We investigate the role of Gaussian curvature in 3D surface modeling. Besides Gaussian curvature being an invariant quantity under change of observers or coordinate systems, we demonstrate using the Middlebury stereo dataset that it offers a sparse and compact description of 3D surfaces. Furthermore, we show a strong correlation between the performance rank of top state-of-the-art stereo and monocular methods and the low total absolute Gaussian curvature. We propose that this property can serve as a geometric prior to improve future 3D reconstruction algorithms.
Quantum physics is intrinsically probabilistic. The entropy of a quantum state quantifies the amount of randomness (or information loss) of such state. The degrees of freedom of a quantum state are position and spin, and upon their specification Born's rule in phase space defines randomness. We focus on the spin degree of freedom and elucidate the spin entropy. Then, we present some of its properties and show how entanglement increases spin entropy. Some speculative predictions on the decay of the $Z^0,W^{+,-}$ gauge bosons conclude the paper.
Quantum physics is intrinsically probabilistic, where the Born rule yields the probabilities associated with a state that deterministically evolves. The entropy of a quantum state quantifies the amount of randomness (or information loss) of such a state. The degrees of freedom of a quantum state are position and spin. We focus on the spin degree of freedom and elucidate the spin-entropy. Then, we present some of its properties and show how entanglement increases spin-entropy. A dynamic model for the time evolution of spin-entropy concludes the paper.
IEEE Transactions on Image Processing · 2023 · 25 citations
Artificial Intelligence
Computer Science
Artificial Intelligence
Image classification for real-world applications often involves complicated data distributions such as fine-grained and long-tailed. To address the two challenging issues simultaneously, we propose a new regularization technique that yields an adversarial loss to strengthen the model learning. Specifically, for each training batch, we construct an adaptive batch prediction (ABP) matrix and establish its corresponding adaptive batch confusion norm (ABC-Norm). The ABP matrix is a composition of two parts, including an adaptive component to class-wise encode the imbalanced data distribution, and the other component to batch-wise assess the softmax predictions. The ABC-Norm leads to a norm-based regularization loss, which can be theoretically shown to be an upper bound for an objective function closely related to rank minimization. By coupling with the conventional cross-entropy loss, the ABC-Norm regularization could introduce adaptive classification confusion and thus trigger adversarial learning to improve the effectiveness of model learning. Different from most of state-of-the-art techniques in solving either fine-grained or long-tailed problems, our method is characterized with its simple and efficient design, and most distinctively, provides a unified solution. In the experiments, we compare ABC-Norm with relevant techniques and demonstrate its efficacy on several benchmark datasets, including (CUB-LT, iNaturalist2018); (CUB, CAR, AIR); and (ImageNet-LT), which respectively correspond to the real-world, fine-grained, and long-tailed scenarios.
Quantum physics through the lens of Bayesian statistics considers probability to be a degree of belief and subjective. A Bayesian derivation of the probability density function in phase space is presented. Then, a Kullback-Liebler divergence in phase space is introduced to define interference and entanglement. Comparisons between each of these two quantities and the entropy are made. A brief presentation of entanglement in phase space to the spin degree of freedom and an extension to mixed states completes the work.
Quantum physics through the lenses of Bayesian statistics consider probabilities to be degree of believes or knowledge and subjective. A Bayesian derivation of the probability density function in phase space is presented. The entropy proposed by Geiger and Kedem \cite{GeiKed2022a,GeiKed2022b} in phase space is expanded to define quantitatively interference and entanglement. Comparisons between each of these two quantities and the entropy are made. A brief presentation of entanglement in phase space to the spin degree of freedom and to mixed states completes the work.
Quantum physics, despite its intrinsically probabilistic nature, lacks a definition of entropy fully accounting for the randomness of a quantum state. For example, von Neumann entropy quantifies only the incomplete specification of a quantum state and does not quantify the probabilistic distribution of its observables; it trivially vanishes for pure quantum states. We propose a quantum entropy that quantifies the randomness of a pure quantum state via a conjugate pair of observables/operators forming the quantum phase space. The entropy is dimensionless, it is a relativistic scalar, it is invariant under canonical transformations and under CPT transformations, and its minimum has been established by the entropic uncertainty principle. We expand the entropy to also include mixed states. We show that the entropy is monotonically increasing during a time evolution of coherent states under a Dirac Hamiltonian. However, in a mathematical scenario, when two fermions come closer to each other, each evolving as a coherent state, the total system's entropy oscillates due to the increasing spatial entanglement. We hypothesize an entropy law governing physical systems whereby the entropy of a closed system never decreases, implying a time arrow for particle physics. We then explore the possibility that as the oscillations of the entropy must by the law be barred in quantum physics, potential entropy oscillations trigger annihilation and creation of particles.
