Questions tagged [optimization]

Question 1

The TVD-MI (Total Variation Distance–Mutual Information) framework provides a reference-free method for certifying LLM judges—models that evaluate outputs like code correctness or theorem proofs ...

Question 2

Background The algorithm to calculate the n-th Fibonacci number using recursion is as follows: ...

Question 3

Problem Setup Let's say we have a bipartite graph $(U, V)$ where the nodes of the graph are labelled with a positive integer and each edge $(u_i, v_i)$ has $u_i < v_i$. Our goal is to find a ...

Question 4

I would like to find all the maximal rectangles contained in a rectilinear shape on a discrete grid. That is, every rectangle such that, if it were to grow by one cell in any direction, it would no ...

Question 5

I have the following constrained (global) optimization problem: For a user defined sorted real values vector: xi = [xi(1), ... , xi(N+1)] I need to find an unknown vector: x = [x(1), ..., x(L)] where ...

Question 6

I want to find if there's a fast algorithm for the following: Given a set of lowest common ancestor constraints, find the smallest (fewest number of nodes) strict binary tree that satisfies all of ...

Question 7

I started thinking about this problem while trying to find the best way to divide a book reading into $4$ roughly equal sections. I ended up brute-forcing every possible combination, but now I'm ...

Question 8

Here’s what I’m working on: I want to build routes that maximize my custom metrics. I don’t want to share the exact details of these metrics, but for every candidate route I calculate N metrics and I’...

Question 9

I am investigating the complexity of the following problem: Let $G=(V,E,w)$ be a finite, simple, directed graph with a non-negative weight function $w:E\to\mathbb{R}_{\ge 0}$. A solution consists of ...

Question 10

Given a simple unlabeled graph $G = (V,E)$ with vertices $V=\{1,\ldots,n\}$, let $L(G)$ a labeled graph obtained by labeling (with distinct labels) the vertices of $G$ through any $l: V \rightarrow V$ ...

Question 11

This specific convergence rate with dominant logarithmic factors is indeed highly desirable for large-scale systems. While there's a rich body of work on stochastic approximation and equilibrium ...

Question 12

This post is about correctness of the BIDDFS (bidirectional iterative-deepening depth-first search). I got this idea from a Richard Korf's paper. Before answering, I suggest you first read this. My ...

Question 13

I'm stuck on what is considered TCS. Are discrete optimization, combinatorial optimization, duality theory parts of TCS?

Question 14

Given a list of characters in $\{a,b\}$, for example $abababababa$, what is the most efficient way to remove all 5th powers in a way that makes the string as short as possible? (This example would ...

Question 15

Let $T$ be the torus of dimension $d$, i.e.: $$ T = \{(e^{i\varphi_1},\dots,e^{i\varphi_d}) : \varphi_k \in [0,2\pi)\} $$ Let $p(z_1,\dots,z_d)$ be a complex multivariate polynomial. How hard ...

Stack Exchange Network

Questions tagged [optimization]

Can We Design Incentive-Compatible LLM Judge Certification Beyond Shared Information Invariants? [closed]

Best strategy with limited ability of memoization

Maximum cardinality matching with a priority order

How to find all maximal rectangles contained in a rectilinear shape on a discrete grid

suprisingly complicated optimization problem

Find a minimal binary tree that satisfies lowest common ancestor constraints

What is the most efficient algorithm for partitioning a list into roughly equal sections?

Best mutations for Simulated Annealing on real graph

NP-hardness proof densest 3-way partitioned weighted subgraph

Graph labeling through optimization of a quadratic form

Can stochastic optimization algorithms achieve convergence in $\Theta(N^{m^{1/s}} / \log^k N)$ with $m > 1, s > 1, k \gg m$? [closed]

Is my implementation of the Richard Korf's bidirectional iterative-deepening depth-first-search (BIDDFS) correct?

What is considered as Theoretical Computer Science?

Remove contiguous 5th powers (5-fold repetitions) from list of 'a's and 'b's?

Is optimizing a multivariate polynomial over a torus NP-hard?

Hot Network Questions