HDSF detects fake news by learning hierarchical discourse-level structures.
problem Detecting fake news articles with minimal annotated corpora.
method Automatically learns and constructs discourse-level structures for fake and real news articles.
result Real and fake news present substantial differences in hierarchical discourse-level structures.
Same cohomology for curves with levels, proving stable range.
problem Stability of cohomology in moduli spaces with level structures.
method Proving cohomology equality through stable range analysis.
result Rational cohomology of moduli space with levels matches ordinary space.
This research tackles uncertainty estimation in autoregressive structured prediction tasks.
problem Ensuring safety and robustness of AI systems through accurate uncertainty estimation.
method Develops a unified probabilistic ensemble-based framework for token-level and sequence-level uncertainty estimation.
result Provides baselines for error and out-of-domain detection on translation and speech recognition datasets.
Bi-GNN models drug interactions using a bi-level graph approach.
problem Predicting drug-drug interactions using machine learning.
method Bi-level graph neural networks that consider both interaction graph and representation graphs of drugs.
result Bi-GNN model improves DDI prediction accuracy compared to existing methods.
Study shows vast rational cohomology in moduli space of curves with level structures.
problem Understanding the cohomology of moduli spaces with level structures.
method Proved existence of enormous rational cohomology in cohomological dimension.
result Cohomological dimension of moduli space of curves is at least g-2.
Proposes a method to improve hierarchical clustering using set-level structural priors.
problem Lack of supervision for non-leaf structure in hierarchical clustering.
method Introduces set-level structural priors for semi-supervised hyperbolic hierarchical clustering.
result Improves label consistency and similarity-based tree quality over baselines.
This paper shows how path spaces on two-level manifolds can be Hilbert manifold structures.
problem Addressing the structure of path spaces on two-level manifolds.
method Introducing the notion of tameness and constructing charts on path spaces of two-level manifolds.
result Path spaces on tame two-level manifolds have the structure of a Hilbert manifold.
We show that a model of chain complex of the free loop space of a C∞-manifold, which is proposed in arxiv:1404.0153, admits an action of a certain dg operad. This is a chain level structure under the Chas-Sullivan BV structure on loop space homology. Our dg operad is a variant of the cacti operad, and we introd…
Study on Chern-Simons theory at generic levels, revealing universal resurgent structure.
problem Analyzing Chern-Simons theory at generic levels with small boundary holonomy.
method Examined resurgent structure of state integral models on knot complements with generic discrete level.
result Resurgent structure is universal, independent of the level k. Improved prediction of hierarchical time series using structured regularization.
problem Making coherent forecasts for hierarchical time series.
method Structured regularization method for bottom-level time series predictions.
result Superior prediction accuracy and computational efficiency compared to previous methods.
The paper tackles multi-level fairness in algorithmic systems, addressing bias at both individual and structural levels.
problem Algorithmic systems can unfairly impact marginalized groups, especially when considering only individual-level bias.
method Formalizes multi-level fairness using causal inference tools, addressing effects of sensitive attributes at multiple levels.
result Illustrates the importance of accounting for macro-level sensitive attributes in fairness assessments.
A new method for solving complex sequential decision-making problems by decomposing them into multiple levels.
problem Sequential decision-making with natural multi-level structure.
method Multi-level meta-reinforcement learning with skill-based curriculum.
result Efficiently reduces stochasticity and policy search space, leading to fewer iterations and computations.
Any singular level of a completely integrable system (c.i.s.) with non-degenerate singularities has a singular affine structure. We shall show how to construct a simple c.i.s. around the level, having the above affine structure. The cotangent budle of the desingularised level is used to perform the construction, and th…
The paper proposes a method to transfer knowledge across different settings using causal theory.
problem Learning transfer across similar but different settings.
method Bayesian perspective of causal theory induction, integrating instance-level associative learning and abstract-level structural causal knowledge.
result The proposed model achieved transfer behavior across trials and learning situations, unlike RL algorithms.
ISAHP discovers instance-level causal structures in event sequences.
problem Discovering fine-grained causal relationships in asynchronous, interdependent event sequences.
method ISAHP, a novel deep learning framework using self-attention mechanism.
result ISAHP meets Granger causality requirements and discovers complex causal structures.
BILBO optimizes bilevel problems without repeated lower-level optimizations.
problem Challenges in bilevel optimization, especially in noisy, constrained, and derivative-free settings.
method BILevel Bayesian Optimization (BILBO) that optimizes both levels simultaneously, using confidence-bounds and function query selection.
result Theoretical and empirical evidence of BILBO's effectiveness on various problems.
In complex financial systems, the sector structure and volatility clustering are respectively important features of the spatial and temporal correlations. However, the microscopic generation mechanism of the sector structure is not yet understood. Especially, how to produce these two features in one model remains chall…
GraphToken encodes structured data for LLMs, improving graph reasoning tasks.
problem Efficiently encoding structured data for large language models.
method GraphToken learns an encoding function to extend prompts with explicit structured information.
result Significant improvements across node, edge, and graph-level tasks on the GraphQA benchmark.
A new model identifies genetic risk factors using gene-level priors.
problem Identifying genetic risk factors from nucleotide-level genetic variants.
method Sparse Group Lasso with Group-level Graph structure (SGLGG) model.
result SGLGG effectively identifies phenotype-associated risk SNPs.
New methods test correlation between network structure and node features.
problem Assessing correlation between network structure and node-level covariates.
method Four novel methods based on linear models and canonical correlation analysis.
result Theoretical guarantees and computational efficiency for testing network dependency.
Approach for recovering shared structure from multiple networks with unknown noise.
problem Recovering shared structure from multiple networks with unknown edge distributions.
method Exploits shared mean structure to denoise edge-level measurements and estimate population-level parameters.
result Established a finite-sample concentration inequality for low-rank eigenvalue truncation of a random weighted adjacency matrix.
Paper explores generalization of AID-based bi-level optimization methods.
problem Uncertainty in generalization properties of AID-based bi-level optimization methods.
method Uniform stability analysis and convergence study of AID-based methods.
result AID-based methods can achieve similar generalization as single-level nonconvex problems.
GRAND ensures node-level differential privacy for network data.
problem Lack of node-level differential privacy for network data.
method Proposes GRAND, the first mechanism for releasing networks with node-level differential privacy and preserving structural properties.
result GRAND releases networks while ensuring node-level differential privacy and preserving structural properties.
Paper proposes a new model for speech synthesis with better interpretability.
problem Improving interpretability in speech synthesis models.
method Hierarchical, fine-grained latent variable model with conditional variational auto-encoder (VAE).
result The new model allows better interpretability without degrading performance.
Text documents are structured on multiple levels of detail: individual words are related by syntax, but larger units of text are related by discourse structure. Existing language models generally fail to account for discourse structure, but it is crucial if we are to have language models that reward coherence and gener…
CSEAL uses cognitive structure to personalize learning paths.
problem Personalized learning paths based on learners' evolving knowledge levels and item structures.
method CSEAL integrates knowledge levels and item structures using a Markov Decision Process and actor-critic algorithm.
result CSEAL effectively personalizes learning paths, improving learning outcomes.
Hierarchical analysis is considered and a multilevel model is presented in order to explore causality, chance and complexity in financial economics. A coupled system of models is used to describe multilevel interactions, consistent with market data: the lowest level is occupied by agents generating the prices of indivi…
A strategy for spectrum sharing in CRNs with multiple PT power levels.
problem Efficient spectrum usage for secondary users in CRNs with multiple PT power levels.
method Data-driven/machine learning based multi-level spectrum sensing and prediction-transmission structures.
result The proposed strategy effectively aligns the ST with the PT power levels, improving spectrum usage.
These are the lecture notes for my course at the 2011 Park City Mathematics Graduate Summer School. The first two lectures covered the basics of the Torelli group and the Johnson homomorphism, and the third and fourth lectures discussed the second cohomology group of the level p congruence subgroup of the mapping class…
Model criticism tool evaluates text coherence and structure in generated long-form text.
problem Evaluate the high-level structure of generated text for coherence, coreference, and topicality.
method Apply model criticism in latent space to compare real and generated data distributions.
result Transformer-based models struggle with maintaining structural coherence and coreference.
Proposes a multi-level learning approach for 3D object recognition.
problem Improving 3D object recognition accuracy through multi-scale spatial features.
method End-to-end multi-level learning on a multi-level voxel grid.
result Comparable object recognition performance with lower memory usage.
Graph transformers outperform graph convolutions by preserving community information.
problem Understanding why graph transformers perform well in node-level prediction tasks.
method Analyzing the Gaussian process limits of graph transformers with infinite width and infinite heads.
result Graph transformers maintain discriminative node representations even in deep layers, preventing oversmoothing.
For 4∤L and g large, we calculate the integral Picard groups of the moduli spaces of curves and principally polarized abelian varieties with level L structures. In particular, we determine the divisibility properties of the standard line bundles over these moduli spaces and we calculate the second integral …
Selective prediction framework reduces errors in molecular structure identification from MS/MS.
problem High-stakes applications require reliable molecular structure identification from MS/MS data.
method Selective prediction framework using risk-coverage tradeoff and uncertainty quantification.
result First-order confidence measures and retrieval-level aleatoric uncertainty achieve strong risk-coverage tradeoffs.
Proposes a method for explaining black-box models with nested feature attributions.
problem Making black-box models transparent and trustworthy.
method Model-agnostic local explanation method exploiting nested feature structure and consistency property.
result Accurate and consistent HiFAs and LoFAs estimated using fewer model queries.
Study robust mean estimation under coordinate-level corruptions using Hamming distance.
problem Robust mean estimation under realistic coordinate-level corruptions.
method Introduce a novel Hamming distance-based measure and present information-theoretic analysis.
result Data cleaning-inspired approaches can match information theoretic bounds for robust mean estimation.
GANs generate DOOM levels similar to human-designed ones.
problem Generating levels similar to human-designed ones in first-person shooter games.
method Extracted features from human-designed levels, trained GANs on these features and level images, generated new levels, compared results.
result GANs can generate levels similar to human-designed ones.
Let W -> A^2 be the universal Weierstrass family of cubic curves over C. For each N >= 2, we construct surfaces parametrizing the three standard kinds of level N structures on the smooth fibers of W. We then complete these surfaces to finite covers of A^2. Since W -> A^2 is the versal deformation space of a cusp singul…
Constructs L∞ structure on symplectic cohomology.
problem None explicitly stated; focuses on construction.
method Constructs L∞ structure on symplectic cohomology. result Symplectic cohomology gains an L∞ structure. This paper reviews and analyzes methods to accelerate CNNs.
problem Computational intensity of CNNs limits their further implementation.
method Taxonomy of acceleration methods at structure, algorithm, and implementation levels.
result Large exploration space remains for each level of acceleration methods.
PFPN improves salient object detection by progressively polishing multi-level features.
problem Improving salient object detection by refining multi-level features.
method Progressive Feature Polishing Network (PFPN) with Feature Polishing Modules (FPMs).
result PFPN achieves superior performance on five benchmark datasets without post-processing.
Consistent SEMs predict the same effects of interventions.
problem Consistency of causal models in SEMs.
method Formalised consistency of SEMs through transformations, emphasizing well-specified interventions.
result Causal models at different levels of detail are consistent.
TS-Fault benchmarks TSF models against structural faults.
problem Evaluating the robustness of time series forecasting models against structured events.
method TS-Fault uses parameterized fault scenarios with controllable difficulty.
result Three findings contradict common leaderboard intuition.
Study approximates unknown function levels with queries.
problem Approximating unknown function levels through sequential queries.
method Introduce Bisect and Approximate algorithms to reduce to local function approximation.
result Rate-optimal sample complexity guarantees for H{ö}lder functions.
Paper tackles efficient SGD methods for constrained bilevel optimization.
problem Stochastic bilevel optimization with equality constraints.
method Alternating implicit projected SGD and its variants.
result Achieves sample complexity matching state-of-the-art for unconstrained problems.
PACE explains ViTs by modeling patch-level concept distributions, surpassing existing methods.
problem Lack of trustworthy post-hoc explanations for Vision Transformers (ViTs)
method Variational Bayesian explanation framework (PACE)
result PACE surpasses state-of-the-art methods in meeting desiderata for ViT explanations.
This paper tackles adversarial attacks on graph data structures.
problem Robustness of graph neural networks against adversarial attacks.
method Reinforcement learning, genetic algorithms, gradient methods.
result Graph Neural Network models are vulnerable to adversarial attacks.
The aim of this paper is to define a chain level refinement of the Batalin-Vilkovisky (BV) algebra structure on the homology of the free loop space of a closed, oriented C∞-manifold. For this purpose, we define a (nonsymmetric) cyclic dg operad which consists of "de Rham chains" of free loops with marked points…