New method evaluates language model forecasters by checking consistency of predictions.
problem Evaluating the performance of language model forecasters is difficult due to lack of ground truth.
method Developed a consistency check framework based on arbitrage to evaluate forecasters.
result Consistency metrics correlate with ground truth performance of LLM forecasters.
We propose a novel approach for analysis of the composition of an equity mutual fund based on the time series decomposition of the price movements of the individual stocks of the fund. The proposed scheme can be applied to check whether the style proclaimed for a mutual fund actually matches with the fund composition. …
The paper proposes a method to evaluate superhuman models by checking for logical inconsistencies.
problem Evaluating superhuman models when ground truth is hard to obtain.
method A framework using consistency checks to identify logical inconsistencies in model decisions.
result Logical inconsistencies can be discovered in superhuman model decisions across various tasks.
Let (Xn,Xˇn) be a mirror pair of an n-dimensional complex torus Xn and its mirror partner Xˇn. Then, a simple projectively flat bundle E(L,L)→Xn is constructed from each affine Lagrangian submanifold L in Xˇn with a unitary local system $\mathcal{L} \righta…
The choice of model class is fundamental in statistical learning and system identification, no matter whether the class is derived from physical principles or is a generic black-box. We develop a method to evaluate the specified model class by assessing its capability of reproducing data that is similar to the observed…
New method simplifies checking consistency of differentiable loss functions.
problem Verifying consistency of differentiable loss functions is difficult.
method Developed a new approach called strong indirect elicitation (strong IE) to simplify checking consistency.
result Strong IE is equivalent to calibration for strongly convex, differentiable surrogates.
A family of Markov blankets in a faithful Bayesian network satisfies the symmetry and consistency properties. In this paper, we draw a bijection between families of consistent Markov blankets and moral graphs. We define the new concepts of weak recursive simpliciality and perfect elimination kits. We prove that they ar…
SANST uses self-attentive networks with spatial and temporal embeddings for better POI recommendations.
problem Next point-of-interest (POI) recommendation for users based on their history.
method SANST incorporates spatio-temporal patterns into self-attentive networks.
result SANST outperforms state-of-the-art models by up to 13.65% in nDCG@10.
In many countries information on expectations collected through consumer confidence surveys are used in macroeconomic policy formulation. Unfortunately, before doing so, the consistency of responses is often not taken into account, leading to biases creeping in and affecting the reliability of the indices hence created…
New method improves spatial prediction validation accuracy.
problem Validation methods fail for spatial prediction tasks due to mismatch between validation and test locations.
method Proposes a new validation method that adapts existing covariate-shift ideas to spatial settings.
result Proves and demonstrates the new method's superiority in spatial prediction validation.
We give a definition of an integer-valued function ∑iαixi∗ derived from arrow diagrams for the ambient isotopy classes of oriented spherical curves. Then, we introduce certain elements of the free Z-module generated by the arrow diagrams with at most l arrows, called relators of Type~($\check{…
Paper proves conditions for estimating precision matrices with Laplacian constraints.
problem Estimating high-dimensional precision matrices with Laplacian constraints.
method Minimizing Stein's loss with conditions on graph connectivity and Laplacian constraints.
result High-dimensional consistency achieved with Laplacian constraints, independent of graph structure.
This paper deforms complex tori and their mirrors using gerbes.
problem Deforming complex tori and their mirror partners.
method Using flat gerbes to deform complex tori and their mirrors, constructing holomorphic line bundles over deformed objects.
result Deformed complex tori and their mirrors can be studied using flat gerbes.
Statistical model checking for PCTL on MDPs using reinforcement learning.
problem Model checking PCTL specifications on MDPs with statistical methods.
method Reinforcement learning for policy search, statistical model checking with UCB-based Q-learning.
result Provably guaranteed statistical model checking method for PCTL specifications on MDPs.
Research aims to make fact-checking models more transparent.
problem Making fact-checking models explainable in a complex field.
method Combines fact-checking methods with explainable AI techniques.
result Developed initial solutions for explainable fact-checking.
We study a Markov-Functional (MF) interest-rate model with Uncertain Volatility Displaced Diffusion (UVDD) digital mapping, which is consistent with the volatility-smile phenomenon observed in the option market. We first check the impact of pricing Bermudan swaptions by the model. Next, we also investigate the future s…
Time-aware fact-checking improves veracity predictions for time-sensitive claims.
problem Fact-checking decisions should consider temporal information of claims and evidence.
method Investigated four temporal ranking methods to optimize evidence ranking for fact-checking models.
result Time-aware evidence ranking surpasses relevance assumptions and improves veracity predictions for time-sensitive claims.
DC-Check helps guide ML development by considering data-centric aspects.
problem Lack of standardized framework for data-centric considerations in ML.
method DC-Check is a checklist-style framework for data-centric AI at ML pipeline stages.
result Promotes thoughtfulness and transparency in ML development.
New diagnostic method detects misspecified models in inverse PDE problems.
problem Misleading residual-norm diagnostics in inverse PDE problems.
method Structure-sensitive sequential diagnostic using e-processes.
result Rejects fitted models that produce biased predictions.
This work analyzes the Gompertz-Pareto distribution (GPD) of personal income, formed by the combination of the Gompertz curve, representing the overwhelming majority of the economically less favorable part of the population of a country, and the Pareto power law, which describes its tiny richest part. Equations for the…
Efficiently checks local robustness in neural networks using geometric projections.
problem Ensuring robustness of neural networks against adversarial inputs.
method Systematic search for decision boundaries in convex polyhedral regions using geometric projections.
result Shows geometric projections can efficiently check robustness in neural networks.
Low-density parity-check codes, a class of capacity-approaching linear codes, are particularly recognized for their efficient decoding scheme. The decoding scheme, known as the sum-product, is an iterative algorithm consisting of passing messages between variable and check nodes of the factor graph. The sum-product alg…
High-performance quantum codes decoded with minimal data.
problem Efficient decoding of linear-rate LDPC quantum codes.
method Tessellations of hyperbolic manifolds, Coxeter groups, and Galois fields.
result Achieved encoding rate of 13/72 with high performance.
Proves SYZ mirror symmetry for del Pezzo and rational elliptic surfaces.
problem Proving mirror symmetry for specific Calabi-Yau surfaces.
method Adapting Hein's work, constructing asymptotically semi-flat Calabi-Yau metrics, and defining a mirror map.
result Existence and uniqueness of Calabi-Yau metrics on Y∖D. Social networks are getting closer to our real physical world. People share the exact location and time of their check-ins and are influenced by their friends. Modeling the spatio-temporal behavior of users in social networks is of great importance for predicting the future behavior of users, controlling the users' mov…
We describe the infinitesimal moduli space of pairs (Y,V) where Y is a manifold with G2 holonomy, and V is a vector bundle on Y with an instanton connection. These structures arise in connection to the moduli space of heterotic string compactifications on compact and non-compact seven dimensional spaces, e.…
Formalizes weak and strong verification for LLMs, controlling errors without assumptions.
problem Balancing cost and reliability in reasoning with LLMs.
method Formalizes weak-strong verification policies, introduces metrics, develops online algorithm.
result Optimal policies admit a two-threshold structure, and calibration and sharpness govern value of weak verifiers.
By the SYZ construction, a mirror pair (X,Xˇ) of a complex torus X and a mirror partner Xˇ of the complex torus X is described as the special Lagrangian torus fibrations X→B and Xˇ→B on the same base space B. Then, by the SYZ transform, we can construct a simpl…
PCS-UQ framework improves uncertainty quantification for machine learning models.
problem Ensuring trustworthy uncertainty quantification for machine learning models in high-stakes domains.
method PCS-UQ framework based on Predictability, Computability, and Stability principles, integrating prediction-checking, bootstrap samples, and multiplicative calibration.
result PCS-UQ maintains target coverage while outperforming or matching conformal methods in interval width and subgroup coverage.
We prove the following result announced in Todorov and Valov: Any homogeneous, metric ANR-continuum is a VGn-continuum provided dimGX=n≥1 and Hˇn(X;G)=0, where G is a principal ideal domain. This implies that any homogeneous n-dimensional metric ANR-continuum with $\check{H}^n(X;G)\neq…
This study analyzes how one-layer transformers learn regular language recognition tasks.
problem Understanding how one-layer transformers solve regular language recognition tasks like even pairs and parity check.
method Theoretical analysis of training dynamics and gradient descent for a one-layer transformer.
result A one-layer transformer can solve even pairs directly but needs CoT for parity check. Training phases show rapid growth in attention layer followed by logarithmic growth in linear layer.
We specify a result of Yokoi \cite{yo} by proving that if G is an abelian group and X is a homogeneous metric ANR compactum with dimGX=n and Hˇn(X;G)=0, then X is an (n,G)-bubble. This implies that any such space X has the following properties: Hˇn−1(A;G)=0 for every closed…
Paper checks SSC for matrix factorizations using Gurobi.
problem Checking the SSC for various matrix factorizations.
method Formulated as a non-convex quadratic optimization problem over a bounded set, solved with Gurobi.
result SSC can be checked in reasonable time for realistic scenarios.
Study how past radiation determines present matter in Penrose's cyclic cosmology.
problem Determining matter content in the present eon from past radiation in Penrose's cyclic cosmology.
method Solve Einstein's equations for a spherical wave in the past eon, then apply reciprocity to find the present eon's matter content.
result The present eon is filled with three types of radiation: a damped wave, an in-going wave, and randomly scattered waves.
Paper develops Euler scheme for fractional delay diff. eqs with additive noise.
problem Developing a consistent Euler-Maruyama scheme for fractional stochastic delay diff. eqs.
method Euler-Maruyama scheme for fractional Brownian motion with additive noise.
result Achieved convergence rate of H+1/2 for smooth delays when H>1/2.
We study the Yamabe invariants of cylindrical manifolds and compact orbifolds with a finite number of singularities, by means of conformal geometry and the Atiyah-Patodi-Singer L2-index theory. For an n-orbifold M with singularities ΣΓ={(pˇ1,Γ1),...,(pˇs,Γs)} (where each group $Γ_j<O…
For an immersed Lagrangian submanifold, let Aˇ be the Lagrangian trace-free second fundamental form. In this note we consider the equation ∇∗T=0 on Lagrangian surfaces immersed in C2, where T=−2∇∗(Aˇ┘ω), and we prove a gap theorem for the Whitney sphere as a solution …
The paper characterizes boundaries in Turaev-Viro TQFTs and Dijkgraaf-Witten theories.
problem Characterizing boundaries in Turaev-Viro TQFTs and Dijkgraaf-Witten theories.
method Identifying explicit boundary locality conditions and proving consistency with state sum models.
result Turaev-Viro and Dijkgraaf-Witten theories with boundary defects admit a state sum description.
In the framework of supervised classification (discrimination) for functional data, it is shown that the optimal classification rule can be explicitly obtained for a class of Gaussian processes with "triangular" covariance functions. This explicit knowledge has two practical consequences. First, the consistency of the …
AutoPC optimizes hyperparameters for the PC algorithm to improve its performance.
problem The unsupervised nature of the PC algorithm makes it difficult to tune the Type I α level. method AutoPC optimizes α directly for a chosen metric and ensures stability through a second run. result AutoPC consistently outperforms state-of-the-art methods across multiple metrics.
Paper verifies RNNs using automata learning and model checking.
problem Verifying the correctness of RNNs is challenging.
method Learn a deterministic finite automaton from RNN, use model checking for verification.
result Can discover and generalize counterexamples to faulty flows.
Constructing brane quantization for An-resolutions using SYZ mirror symmetry.
problem Quantizing branes on singular fibers using SYZ mirror symmetry.
method Constructing coisotropic A-branes and their mirrors via fiberwise geometric quantization.
result Establishing a mirror isomorphism between endomorphism algebras.
This paper enhances privacy in statistical model checking of cyber-physical systems.
problem Privacy concerns in consumer-level applications due to statistical model checking.
method Proposes expected differential privacy and a new exponential mechanism for sequential algorithms.
result Demonstrates a novel mechanism to preserve privacy in statistical model checking.
We present FAKTA which is a unified framework that integrates various components of a fact checking process: document retrieval from media sources with various types of reliability, stance detection of documents with respect to given claims, evidence extraction, and linguistic analysis. FAKTA predicts the factuality of…
A machine-checked Itô calculus for Brownian motion on [0,T]
problem Developing an L2 Itô calculus for Brownian motion method Formalized in Lean 4 on top of Mathlib and the BrownianMotion package
result First machine-checked proof of Itô's formula and construction of Itô integral as martingale-valued process
New dataset for industrial machine malfunction detection with domain shifts.
problem Challenges in detecting anomalies due to domain shifts in industrial sounds.
method Created a dataset with domain shifts for five types of industrial machines.
result Significant performance differences between source and target domains.
Model combination, often regarded as a key sub-field of ensemble learning, has been widely used in both academic research and industry applications. To facilitate this process, we propose and implement an easy-to-use Python toolkit, combo, to aggregate models and scores under various scenarios, including classification…
Randomly initialized networks can perform as well as pruned networks.
problem Understanding and improving network pruning methods.
method Sanity checks on recent pruning methods, proposing random tickets.
result Randomly initialized networks can perform as well as pruned networks.