Characterizes graphs with leveled embeddings and introduces new graph invariants.
problem Understanding the properties of leveled embeddings in spatial graphs.
method Characterization of graphs with leveled embeddings, introduction of new invariants.
result Characterization of graphs with low level number and determination of specific invariants for complete graphs and complete bipartite graphs.
This paper analyzes user-level local differential privacy in distributed systems.
problem The relationship between user-level and item-level local differential privacy under the local model is complex.
method The paper analyzes the mean estimation problem and applies it to stochastic optimization, classification, and regression. It proposes adaptive strategies to achieve optimal performance at all privacy levels.
result The proposed methods are minimax optimal up to logarithmic factors and show that user-level DP can lead to faster convergence rates than item-level DP.
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.
This paper shows how procedural level generation improves deep RL models' generalization.
problem Deep RL models overfit to fixed environments, failing to generalize to new levels.
method Procedurally generated levels during training to enhance generalization.
result Procedural level generation enables better generalization to new levels and improved performance with less data.
Music FaderNets learns high-level musical qualities from low-level attributes.
problem Learning high-level musical qualities from limited data and subjective labels.
method Model low-level attributes through feature disentanglement and latent regularization; infer high-level features from low-level representations using GM-VAEs.
result Model successfully learns intrinsic relationships between high-level features and low-level attributes with minimal labeled data.
The paper discovers and evaluates support and resistance levels in financial time series.
problem Understanding and predicting support and resistance levels in financial markets.
method Developed a heuristic discovery algorithm to identify SR levels in intraday price series.
result Discovered SR levels statistically significantly reverse price trends and have a decay aspect over time.
Paper addresses instance-level label prediction in MIL, improving performance compared to existing methods.
problem Lack of instance-level label prediction in existing MIL approaches restricts their applicability.
method Proposes a novel algorithm with instance-level loss function, unbiasedly and consistently estimated.
result Empirically validated superior instance-level and bag-level performance compared to state-of-the-art methods.
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.
Minimal graph level sets are concave if boundary is concave.
problem Understanding curvature of minimal graph level sets.
method Proved an inequality and showed geometric properties.
result Level sets of minimal graphs are concave if boundary is concave.
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.
This paper reports the performances of shallow word-level convolutional neural networks (CNN), our earlier work (2015), on the eight datasets with relatively large training data that were used for testing the very deep character-level CNN in Conneau et al. (2016). Our findings are as follows. The shallow word-level CNN…
The study finds integral identities for level hypersurfaces.
problem Understanding metric properties of level hypersurfaces.
method Establishes integral identities relating metric properties.
result Integral identities for level hypersurfaces of Morse functions.
The study examines how character and word-level representations improve sentence-level tasks.
problem Improving the quality of word and sentence representations using character-level information.
method Feature-wise sigmoid gating mechanism for combining character and word-level representations.
result Modeling characters improves final word and sentence representations, especially for less frequent words.
New method uses image-level and pixel-level annotations for brain tumor segmentation.
problem Challenges in obtaining pixel-level annotations for brain tumor segmentation.
method Proposes a learning-based framework that combines both pixel- and image-level annotations.
result Method's performance in segmentation quality is competitive with traditional fully-supervised approach.
FRESH combines patient-level and aggregate-level data for better clinical decision making.
problem Combining patient-level and aggregate-level data for clinical decision making.
method FRESH method that re-calibrates a patient-level model to match specified aggregate statistics.
result Unified data-efficient model for clinical decision making.
New framework tackles bi-level optimization without LLS condition.
problem Bi-level optimization problems without LLS condition.
method Bi-level Descent Aggregation (BDA) framework, proving convergence without LLS condition.
result Proves convergence of BDA without LLS condition.
This paper improves level generation using VAEs for coherent, logically following segments.
problem Generating coherent levels of non-fixed length and blending levels from different games.
method Sequential segment-based level generation using VAEs with a classifier for logical placement.
result Generated levels are more coherent and capable of blending levels from different games.
GMVAEs cluster and generate game levels without labels.
problem Manual exploration of latent space for VAE-generated game levels.
method Apply Gaussian Mixture VAEs (GMVAEs) to learn latent clusters and generate levels.
result GMVAEs can cluster and generate game levels without requiring labels.
TOAD-GAN generates coherent game levels from a single example.
problem Creating game levels from a single example.
method Token-based Procedural Content Generation (PCG) using SinGAN architecture.
result Achieves state-of-the-art results in generating coherent levels of similar style.
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.
The paper calculates dimensions of higher Landau levels on compact manifolds.
problem Understanding Landau levels on compact manifolds in the large magnetic field limit.
method Computing dimensions as Riemann-Roch numbers, studying Toeplitz algebras, and proving isomorphisms.
result Each Landau level is isomorphic to a quantization twisted by an auxiliary bundle.
Characterizes level-set families of harmonic functions without critical points.
problem Understanding level-set families of harmonic functions without critical points.
method Characterization via local differential-geometric condition and construction from geometric data.
result Evolution of gradient of harmonic functions determined by mean curvature of level sets.
The ( 1 , 1 ) (1,1) ( 1 , 1 ) -length of a knot is a braid group invariant equaling its level number.
problem Finding a numerical invariant for knot positions.
method Using braid group on two points in the torus to describe and calculate the ( 1 , 1 ) (1,1) ( 1 , 1 ) -length. result The ( 1 , 1 ) (1,1) ( 1 , 1 ) -length equals the level number of a knot. Study compares hypergraph and graph-level models for higher-order relational learning.
problem Evaluating effectiveness of hypergraph-level vs. graph-level models in relational learning.
method Systematic evaluation of various hypergraph and graph-level architectures.
result Graph-level models applied to hypergraph expansions outperform hypergraph-level models.
For leveled spatial graphs, we find a surface embedding that allows cellular embedding.
problem Finding a surface embedding for general spatial graphs is not always possible.
method Define leveled property, decompose graph into subgraphs, and construct surface.
result For leveled spatial graphs with a small number of levels, a surface can always be found.
Researchers infer firm-level supply chain networks from sector-level data to assess systemic risk.
problem Estimating systemic risk in economic systems using firm-level data.
method Maximum-entropy algorithms applied to input-output tables and firm-level aggregate output data.
result The most realistic systemic risk content is retrieved by models incorporating disaggregated firm-specific inputs by sector.
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.
New scoring rules for multivariate distributions and level sets.
problem Evaluating forecast accuracy for multivariate distributions and level sets.
method Theoretical framework for scoring rules, decomposition of multivariate scoring functions, numerical algorithm for computation.
result New scoring functions for multivariate distributions and level sets, including density and cumulative distribution level sets.
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.
End-to-end ASR model combines word and character representation for improved performance.
problem Difficulty in training with word-level supervision due to sparsity of examples.
method Multi-task learning framework combining word and character representations.
result Improved word-error rate (WER) by interpolating between word-level and character-level models.
Two novel network quantization approaches improve deep neural network compression.
problem Efficiently compress deep neural networks for practical usage.
method Single-level network quantization (SLQ) and Multi-level network quantization (MLQ).
result Both SLQ and MLQ achieve impressive results in compressing state-of-the-art neural networks.
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.
Develops a method to ensure accurate quantile forecasts across multiple levels.
problem Ensuring accurate quantile forecasts at multiple levels, even under distribution shifts.
method Multi-level quantile tracker (MultiQT) wraps around any forecaster to produce calibrated forecasts.
result Guaranteed calibration of quantile forecasts at multiple levels, even against adversarial shifts.
Method learns diverse robot skills for complex tasks.
problem Simulation-to-real transfer for robot skills.
method Decomposes skills, learns parameterized embeddings, and composes them.
result Transferable high-level policies using low-level skills.
Trajectory-level supervision allows efficient offline reinforcement learning.
problem Offline reinforcement learning
method Developing a statistical theory for offline policy optimization from trajectory-level labels
result Proving a high-probability guarantee of order O ~ ( H 2 C s a ( π ⋆ ) / n ) \widetilde O(H^2\sqrt{C_{sa}(\pi^\star)/n}) O ( H 2 C s a ( π ⋆ ) / n ) 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.
Counterexample shows level-preserving map from isotopy is not always an embedding.
problem Level-preserving maps from isotopies not always embeddings.
method Simple counterexample.
result Level-preserving map from isotopy is not always an embedding.
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.
Polynomials with similar modulus levels are bilipschitz equivalent.
problem Understanding when polynomials are bilipschitz equivalent.
method Examined polynomials with moduli up to bilipschitz equivalence.
result Level curves of polynomials are bilipschitz equivalent.
Study shows how SL 2 \operatorname{SL}_2 SL 2 Hitchin connection at level four behaves.
problem Understanding the behavior of SL 2 \operatorname{SL}_2 SL 2 Hitchin connection at level four. method Using Mumford-Welters connections and equivariant conformal embeddings, the connection's monodromy is shown to be finite.
result The monodromy of the SL 2 \operatorname{SL}_2 SL 2 Hitchin connection at level four is finite. Quantum representations of mapping class groups are locally rigid at prime levels.
problem Locally rigid properties of quantum representations of mapping class groups.
method Proving local rigidity for Fibonacci representations of mapping class groups at prime levels.
result Local rigidity of Fibonacci representations of mapping class groups at prime levels.
Novel method for bilevel optimization with convex lower-level problem.
problem Minimizing a smooth objective over the optimal solution set of a convex constrained problem.
method Local cutting plane approximation of lower-level solution set combined with conditional gradient updates.
result Achieves optimal iteration complexity for the considered class of bilevel problems.
New algorithm optimizes adaptive return level for Markowitz portfolios.
problem Finding an optimal return level for Markowitz portfolios when investor's risk appetite is unknown.
method Krasnoselskii-Mann Proximity Algorithm based on proximity operator and momentum technique.
result Significant improvements over state-of-the-art methods in portfolio optimization.
RocketStack integrates predictions from multiple base learners using a recursive stacking architecture up to ten levels.
problem Feature redundancy, complexity, and computational burden in deep stacking.
method Level-aware recursive stacking with pruning and compression techniques.
result Increasing accuracy with depth and outperforming standalone ensembles at later levels.
The article uses surgery on mean curvature flow to study level set flow's regularity and stability.
problem Analyzing the regularity and stability of level set flow.
method Using mean curvature flow with surgery to derive estimates.
result Demonstrates stability of the plane under level set flow.
Hierarchical video model learns actions at coarse and fine levels.
problem Understanding complex video actions at different levels of detail.
method A hierarchical architecture that learns coarse-grained to fine-grained actions.
result Models that learn at multiple levels of granularity perform best.
Hierarchical decoupling improves sample efficiency for complex robots.
problem Learning long-range behaviors on complex robots.
method Two-part policy: low-level imitation and high-level transfer, with KL regularization.
result Hierarchical transfer significantly improves zero-shot high-level transfer and stabilizes learning.
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.