This paper detects function-level obfuscation in binary code using graph-based methods.
problem Detecting and characterizing function-level obfuscation in binary code.
method Graph-based approaches, including GNNs, are compared on various datasets.
result GNNs outperform baselines in function-level obfuscation detection, especially in a 11-class classification task.
Study lower bounds for connectivity of distance function level sets in convex sets.
problem Understanding connectivity of distance function level sets in convex sets.
method Lower bound calculation using critical points of the distance function.
result Provide a lower bound for the range of connectivity.
Study transcendence of abelian differential periods from bi-algebraic perspective.
problem Arithmetic and functional transcendence of periods of abelian differentials.
method Bi-algebraic structure on strata of abelian differentials.
result Characterization of arithmetic points and proof of linear bi-algebraic curves.
Proves a function's locally least gradient property if its level sets are minimal laminations.
problem Understanding the relationship between 1-harmonic functions and minimal laminations.
method Analyzes minimal laminations and their convergence properties, then applies to 1-harmonic functions.
result Proves a function is 1-harmonic if its level sets are minimal laminations.
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.
Bayesian neural networks explore rare fluctuations for better feature learning.
problem Understanding rare but dominant fluctuations in Bayesian neural networks.
method Large-deviation theory and joint optimization over predictors and internal kernels.
result Posterior rate function optimization reveals data-dependent kernel selection.
Increasing numbers of software vulnerabilities are discovered every year whether they are reported publicly or discovered internally in proprietary code. These vulnerabilities can pose serious risk of exploit and result in system compromise, information leaks, or denial of service. We leveraged the wealth of C and C++ …
The paper explores the geometry of level lines of quasiperiodic functions with many periods.
problem Describing the geometry of level lines of quasi-periodic functions with a large number of periods.
method Generalizes the Novikov problem to the multidimensional case of quasiperiodic functions.
result Arises of open or closed level lines of arbitrarily large sizes.
The study classifies rational isoparametric functions on Damek-Ricci spaces.
problem Classifying isoparametric functions on Damek-Ricci spaces.
method Using polynomial functions divided by t for classification. result New isoparametric functions discovered and their properties studied.
BN refines local partition geometry in piecewise-affine networks during training.
problem Understanding the effect of BN on the function realized during training in piecewise-affine networks.
method Analyzing the geometry of switching hyperplanes and affine-region partition conditioned on a mini-batch.
result BN increases expected local partition refinement in ReLU and piecewise-affine networks.
New method simplifies tomographic reconstruction using RKHS.
problem Tomographic reconstruction challenges.
method RKHS framework for X-ray transform.
result Sharp stability results without Fourier transform.
Study on estimating invertible functions with minimax analysis.
problem Minimizing risk of estimating invertible functions on a plane.
method Introduce two types of L2-risks, derive lower and upper rates for minimax values, develop an asymptotically almost everywhere invertible estimator. result Invertibility does not reduce the complexity of the estimation problem in terms of the rate.
New BO methods exploit parallel experiments, reducing search time and improving solution quality.
problem Limitation of Bayesian optimization in exploiting parallel experiments.
method Propose new parallel BO paradigms that exploit the structure of the system to partition the design space.
result Significantly reduce search time and increase probability of finding global solutions.
NeuTSFlow models continuous functions behind time series forecasting.
problem Forecasting treats time series as discrete sequences, ignoring their continuous nature.
method NeuTSFlow uses Neural Operators to learn the transition between historical and future function families.
result NeuTSFlow outperforms traditional methods in forecasting accuracy and robustness.
This paper analyzes tokenized U.S. Treasuries, revealing patterns and roles in blockchain transactions.
problem Limited empirical analysis of transaction-level behaviors in tokenized U.S. Treasuries.
method Quantitative dissection of U.S. Treasury-backed RWA tokens across multiple chains, introducing a curvature-aware representation learning model for address-level economic role inference.
result Decoded transaction-level patterns reveal the degree of retail participation and distinguish roles in Web3 finance.
Researchers use Gaussian processes with non-stationary kernels to model precipitation patterns in the Upper Indus Basin.
problem Uncertainty in precipitation patterns in the Upper Indus Basin, Himalayas.
method Proposes Gaussian processes with structured non-stationary kernels to model precipitation patterns, accounting for spatial variation with a latent Gaussian process.
result The proposed model adapts to varying precipitation patterns across distinct topography and outperforms stationary models in ablation experiments.
New algorithms estimate function levels with near-optimal efficiency.
problem Estimating points where an unknown function exceeds a given threshold.
method Relates to adaptive experimental design methods for linear bandits in RKHS.
result Proves nearly optimal sample complexity bounds for level set estimation.
Signed-permutation coordinate transport improves model alignment across checkpoints.
problem Improper alignment of coordinate-indexed objects across model checkpoints.
method Introduces sign-marginalized Hungarian matching and coordinate-preserving transport.
result Recovering signed-permutation gauge improves coordinate alignment and model performance.
ResNets converge to a limit model with improved error rates.
problem Understanding convergence of ResNets in the large-scale limit.
method Combining cavity method and propagation of chaos arguments on skeleton maps.
result Convergence rate of O(1/sqrt(D)) for ResNets in the large-scale limit.
Consider transportation of one distribution of mass onto another, chosen to optimize the total expected cost, where cost per unit mass transported from x to y is given by a smooth function c(x,y). If the source density f^+(x) is bounded away from zero and infinity in an open region U' \subset R^n, and the target densit…