Trees are friendly to paths if they contain a path with all high-degree vertices.
problem Friendliness between trees and paths.
method Analyzing trees with paths and proving conditions for friendliness.
result A tree is friendly to a path if it contains a path with all vertices of degree greater than 2.
Mathematician-friendly formulation of Atiyah-Patodi-Singer index.
problem Boundary conditions and edge modes in domain-wall fermions.
method Mathematician-friendly derivation of Atiyah-Patodi-Singer index.
result New insights into the interplay of boundary conditions, domain-wall fermions, and edge modes.
Generative Adversarial Network (GAN) generates user-friendly explanations for loan denials.
problem Lack of explainable AI for financial services, especially in loan denials.
method Developed a GAN to generate explanations for loan denials, using a representative dataset.
result Demonstrated the GAN can generate explanations for various stakeholders, including applicants and decision makers.
Paper speeds up large foundation models for time series data.
problem Resource-intensive foundation models limit accessibility.
method Dimensionality reduction techniques, including PCA and neural network adapters.
result Up to 10x speedup and 4.5x more datasets fit on a single GPU.
End-to-end auto-encoder for neural image compression with variable bit rates.
problem Efficient image compression with variable bit rates.
method Block-based auto-encoder system with novel contributions.
result Incremental performance improvement of each contribution.
Spider GAN accelerates GAN training with a new approach.
problem Stable training of Generative adversarial networks (GANs).
method Spider GAN leverages a novel approach to identify closely related datasets (friendly neighborhoods) and uses a new measure (signed inception distance) to accelerate GAN training.
result Spider GAN achieves faster convergence and state-of-the-art FID values with one-fifth of the training iterations.
New approach improves adversarial robustness without sacrificing natural generalization.
problem Balancing adversarial robustness and natural generalization in machine learning.
method Friendly adversarial training (FAT) using early-stopped PGD to find least adversarial data.
result Early-stopped PGD achieves adversarial robustness without compromising natural generalization.
Clarinet uses complementary labels to train classifiers with less source data.
problem Training classifiers with true-label data from source domain is costly.
method Proposes CLARINET to train classifiers with complementary-label source data and unlabeled target data.
result CLARINET significantly outperforms baselines in unsupervised domain adaptation.
Paper improves KNN-Shapley for privacy-friendly data valuation.
problem Privacy challenges in data valuation methods.
method Introduces TKNN-Shapley, a privacy-friendly variant of KNN-Shapley.
result TKNN-Shapley offers superior privacy-utility tradeoff compared to naively privatized KNN-Shapley.
The paper develops efficient algorithms for solving complex problems using coordinate updates.
problem Solving large or high-dimensional datasets with linear and nonlinear mappings.
method Develops coordinate-friendly operators and algorithms for various applications.
result New algorithms for machine learning, image processing, and optimization problems.
Survey on techniques to make machine learning models understandable.
problem Humans cannot understand complex machine learning model decisions.
method Survey of existing techniques to increase interpretability.
result Challenges and achievements in interpretable machine learning need further exploration.
Simplifies RCA for anomalies with separable likelihoods.
problem Challenges in accurate and friendly root cause analysis.
method Bayesian framework with separable likelihoods under certain restrictions.
result Framework successfully applied to web server error logs.
A new, computationally friendly formula for a class of risk-averse preferences.
problem Characterizing a class of risk-averse preferences called uniformly weighted divergence preferences.
method Introducing a new formula that characterizes UWDP as the translation-invariant hull of state-independent expected utility.
result UWDP are the translation-invariant hull of state-independent expected utility over L0. New algorithms adapt to friendly environments in online learning.
problem Oracle-efficient algorithms struggle with friendly environments.
method Follow-the-perturbed-leader algorithms with approximability condition.
result Best-of-both-worlds bound in oracle-efficient setting.
Advocates for user-friendly RL problem descriptions to improve usability and generalization.
problem Usability and generalization challenges in RL for non-engineers.
method Development of user-friendly description languages for RL problems.
result Improved ability of RL algorithms to generalize to new problems.
TRUST improves tree models' accuracy while maintaining interpretability.
problem Piecewise-constant regression trees lack in predictive accuracy compared to black-box models.
method Combines Random Forest accuracy with interpretability of shallow trees and sparsity of linear models, using LLMs for explanations.
result TRUST outperforms other interpretable models in predictive accuracy and matches Random Forest's accuracy.
Physicists explain a mathematical theorem about topological insulators.
problem Mathematical formulation of APS index theorem not directly related to physical fermion system.
method Reformulated APS index theorem using η invariant of domain-wall Dirac operator.
result Equivalence between APS index and η invariant is generally true.
A user-friendly interface constructs effective background knowledge from ER diagrams.
problem Inefficient construction of background knowledge by domain experts in ILP systems.
method Design of a graphical user interface to interact with Entity Relationship diagrams to construct modes for a probabilistic logic learning system.
result Domain experts can construct effective background knowledge on par with experts using the graphical interface.
Optimized method tackles convex optimization with heavy-tailed noise.
problem Convex optimization problems with noisy gradients.
method Vanilla stochastic proximal subgradient method without gradient clipping or normalization.
result Achieves optimal complexity for various convex optimization types under heavy-tailed noise.
A simplified, user-friendly repackaging of the curvature estimates implied by the Seiberg-Witten equations is formulated in terms of the convex hull of the set of monopole classes. New results are also obtained concerning boundary cases of the resulting forms of the curvature estimates.
EvaSylv software evaluates forest management with natural risk considerations.
problem Evaluating forest management under increased natural risk due to climate change.
method User-friendly software simulates forest management scenarios, integrating natural risk using a Poisson process and Faustmann approach.
result Software optimizes forest management criteria like Faustmann value and Averaged yield value.
Geometrically describes polygon space cohomology rules.
problem Understanding cohomology of polygon spaces.
method Two geometrically meaningful presentations of cup product rules.
result Simple rules for cup product in polygon spaces.
HMQ improves quantization for edge devices with mixed precision.
problem Efficient quantization for edge devices with uniform, power-of-two thresholds.
method Introduces HMQ, a mixed precision quantization block that repurposes Gumbel-Softmax for searching over quantization schemes.
result Achieves competitive and state-of-the-art results on ImageNet despite restrictions.
ProSeNet provides interpretable deep sequence models with natural explanations.
problem Challenges in explaining deep neural network predictions for sequence modeling.
method Prototypes derived from case-based reasoning, with criteria for simplicity, diversity, and sparsity.
result Achieves accuracy on par with state-of-the-art models while providing interpretable explanations.
Benchmark tests spoken language models for infant language learning.
problem Understanding how infants learn language from speech.
method Developed a language-acquisition-friendly benchmark.
result Benchmarking shows models' strengths and weaknesses.
This reviews the econophysics activities in Belgium from my admittedly biased point of view. Unknown historical notes or facts are presented for the first time explaining the aims, whence evolution of the research papers and friendly connections with colleagues. Comments on endeavors are also provided. The lack of offi…
We study holomorphic foliations with an affine homogeneous transverse structure. We give a friendly characterization of the case of transversely affine foliations in terms of matrix valued pairs of differential forms. This leads naturally to the study of the case of foliations with singularities. A first extension theo…
Flexible Cox model for time-dependent covariates with complex sparsity patterns.
problem Lack of flexibility in enforcing specific sparsity patterns in time-dependent Cox models.
method Proposes a flexible framework for variable selection in time-dependent Cox models, accommodating complex selection rules.
result Achieves accurate estimation with low false alarm rates for complex covariate structures.
RNNs are competitive but not as user-friendly as ETS and ARIMA.
problem Improving RNNs for non-expert users.
method Empirical study and open-source framework of RNN architectures.
result RNNs can model seasonality directly if the series have homogeneous patterns.
Researchers propose a method to quantify explainability in AI systems.
problem Lack of consensus and quantification of explainability in AI systems.
method Analyzed definitions from different disciplines, proposed a quantification approach.
result Proposed a reasonable and model-agnostic way to quantify explainability.
Machine learning improves PMD compensation in multiplexed systems.
problem Improving performance in multiplexed systems with PMD.
method Model-based machine learning parameterizing the Manakov-PMD equation.
result Performance close to PMD-free case achieved with hardware-friendly DBP and PMD compensation.
Paper presents a method to create tight triangulations of manifolds.
problem Finding tight triangulations of manifolds in higher dimensions.
method Combinatorial scheme to generate tight triangulations.
result New examples of tight triangulations in dimensions 3, 4, and 5.
A new algorithm POGO optimizes thousands of orthogonal matrices efficiently.
problem Optimizing thousands of orthogonal constraints at scale is computationally expensive.
method Revisits Landing algorithm, uses modern adaptive optimizers, reduces hyperparameters.
result POGO optimizes thousands of orthogonal matrices in minutes, outperforming alternatives.
S2D selectively decays large singular values to improve quantization of neural activations.
problem Large activation outliers in transformer models cause accuracy drops during quantization.
method Selective Spectral Decay (S2D) that surgically regularizes only the largest singular values. result Significantly reduces activation outliers and produces well-conditioned representations.
Two effective methods for writing the dynamical equations for non-holonomic systems are illustrated. They are based on the two types of representation of the constraints: by parametric equations or by implicit equations. They can be applied to linear as well as to non-linear constraints. Only the basic notions of vecto…
Dual-based algorithms optimize distributed convex problems over networks.
problem Optimizing distributed convex problems over network constraints.
method Dual formulation of primal problem, distributed algorithms achieving optimal rates.
result Achieves optimal rates similar to centralized algorithms with additional cost related to network spectral properties.
Paper simplifies concentration inequalities for easier probabilistic analysis.
problem Complexity in probabilistic analysis of random variables.
method Compact notations for concentration inequalities.
result Simplified expressions for typical sizes and tails of random variables.
For a given cusped 3-manifold M admitting an ideal triangulation, we describe a method to rigorously prove that either M or a filling of M admits a complete hyperbolic structure via verified computer calculations. Central to our method are an implementation of interval arithmetic and Krawczyk's Test. These techni…
Unified techniques improve stability and replicability in changing data.
problem Concept drift in data generating distribution.
method Removing hidden confounding and causal regularization.
result Improves stability, replicability, and robustness in heterogeneous data.
Python package for projecting onto quadratic hypersurfaces.
problem Projections onto non-cylindrical central quadratic hypersurfaces.
method User-friendly Python package with documentation.
result Efficiently projects points onto quadratic hypersurfaces.
In this paper we derive the optimal execution trajectory for a trader who wishes to buy or sell a large position of shares which evolve as a geometric Brownian process in contrast to the arithmetic model which prevails in the existing literature, and with a general temporary impact h. We provide a couple of examples …
Introduces systolic inequalities in Riemannian and symplectic geometry.
problem Exploring systolic inequalities in different geometric settings.
method Comparing classical Riemannian metrics to recent symplectic measurements.
result Illustrates connections between Riemannian and symplectic geometry.
Improves medication name inference for telemedicine and conversational agents.
problem Challenges in mapping user-friendly medication names to standardized ones.
method Entity-boosted two-tower neural network for ranking SMN to DMP.
result State-of-the-art results achieved with improved attention-based ranking.
Lecture notes on monopole Floer homology, including differential geometry and correction terms.
problem Defining and understanding monopole Floer homology.
method Explains differential geometry, Morse theory, and four-dimensional theory connections.
result Sketches the relation to Manolescu's disproof of the Triangulation Conjecture.
Quantum computing optimizes ESG portfolios efficiently.
problem Optimizing investment portfolios with risk, return, and ESG considerations.
method Formulated discrete Markowitz portfolio theory (DMPT) for quantum annealers, incorporating ESG ratings.
result Discrete portfolios converge to continuous solutions as budgets increase, outperforming traditional methods.
Legendrian knots in tight 3-sphere are uniquely determined by their exteriors.
problem Determining Legendrian knots in tight contact structures.
method Contactomorphism type of exterior, Thurston-Bennequin invariant formula.
result Not all Legendrian links in tight 3-sphere are uniquely determined by their exteriors.
Introduction to contact invariant in bordered Floer homology.
problem Understanding the contact invariant in bordered Floer homology.
method Construction relies on special foliated open books, with a procedure to obtain such books and a local proof of vanishing for overtwisted structures.
result Explicit bordered computation of the vanishing of the contact invariant for overtwisted structures.
Paper analyzes how weather data improves solar power prediction.
problem Predicting the unpredictability of solar power generation.
method Examined the impact of weather data on photovoltaic power prediction.
result Weather data significantly improves photovoltaic power prediction accuracy.